scispace - formally typeset
Search or ask a question
Topic

Hazy Sighted Link State Routing Protocol

About: Hazy Sighted Link State Routing Protocol is a research topic. Over the lifetime, 6936 publications have been published within this topic receiving 169377 citations. The topic is also known as: HSLS.


Papers
More filters
Journal ArticleDOI
TL;DR: A road aware geographical routing protocol for urban vehicular ad hoc networks is proposed that uses distance, direction and traffic density routing metrics to forward the data towards the destination.
Abstract: The new information and communication technologies have changed the trend of communication in all fields. The transportation sector is one of the emerging field, where vehicles are communicating with each other or with infrastructure for different safety and comfort applications in the network. Vehicular ad hoc networks is one of the emerging multi-hop communication type of intelligent transportation field to deal with high mobility and dynamic vehicular traffic to deliver data packets in the network. The high mobility and dynamic topologies make the communication links unreliable and leads to frequent disconnectivity, delay and packet dropping issues in the network. To address these issues, we proposed a road aware geographical routing protocol for urban vehicular ad hoc networks. The proposed routing protocol uses distance, direction and traffic density routing metrics to forward the data towards the destination. The simulation results explore the better performance of proposed protocol in terms of data delivery, network delay and compared it with existing geographical routing protocols.

44 citations

Journal ArticleDOI
01 Aug 2009
TL;DR: Simulation results show that both MEDSR and HMEDSR protocols reduce energy consumption per data packet, but HMESDR further reduces energy consumption by 12% compared to MEDSR by controlling overhead packets.
Abstract: In this paper, Minimum Energy Dynamic Source Routing (MEDSR) and Hierarchical Minimum Energy Dynamic Source Routing (HMEDSR) protocols for Mobile Ad Hoc Networks (MANET) are proposed. The objective of MEDSR protocol is to reduce energy consumption in MANET while maintaining connectivity in the network. The objective of HMEDSR is to reduce the overhead of MEDSR. The overall result is that energy spent in transmitting overhead packets is reduced. This reduction allows more energy in transmitting data packets. The Dynamic Source Routing (DSR) protocol is modified to implement both MEDSR and HMEDSR protocols, and these implementations are tested with a network simulator (Network Simulator (NS-2)). The simulation results show that both MEDSR and HMEDSR protocols reduce energy consumption per data packet by 25% compared to DSR, but HMESDR further reduces energy consumption by 12% compared to MEDSR by controlling overhead packets.

44 citations

Journal ArticleDOI
TL;DR: It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully and be intoduced to distribute the routing overhead uniformly among the mobile base stations.
Abstract: In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are introduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.

44 citations

Proceedings ArticleDOI
Maoshen Ren1, Chao Liu1, Huizhou Zhao1, Tong Zhao1, Wei Yan1 
26 Dec 2007
TL;DR: An applied wireless mesh network named MEMO with transparent client access support and mobile node mobility management with special routing scheme called AODV_MEMO which combines routing and mobility management into a single solution.
Abstract: In this paper, we design and implement an applied wireless mesh network named MEMO with transparent client access support and mobile node mobility management. Unlike traditional design, our proposed solution is based on MAC layer triggered mechanism and special routing scheme called AODV_MEMO which combines routing and mobility management into a single solution. The advantages of AODV-MEMO solution include: (1) no modification is required on mobile nodes; (2) mobility management is accomplished in distributed way, no central location server is needed; (3) cross- layer interaction between MAC and Routing Layer effectively reduces the handover time of mobile nodes roaming. In addition, an effective gateway function has been implemented based on the AODV-MEMO routing. Real test-bed experiment proves our design is feasible and efficient.

44 citations

Journal ArticleDOI
TL;DR: The proposed protocol CAERP has significantly improved in average energy consumption, survival rate and the extended the network life cycle which means the energy efficiency of the CAerP network is improved.
Abstract: Background: Wireless sensor networks are application-based networks designed by large number of sensor nodes. Utilizing the energy in efficient way is the one of the main design issue in Wireless Sensor Network (WSN). Limited battery capacity of sensor nodes makes energy efficiency a major and challenging problem in wireless sensor networks. Methods : In order to improve Network lifetime, Energy efficiency and Load balance in Wireless Sensor Network, a Cluster Arrangement Energy Efficient Routing Protocol CAERP is proposed. It mainly includes efficient way of node clustering and distributed multi-hop routing. In the clustering part of CAERP we introduce an un-even clustering mechanism. Cluster head which are closer to the Base Station (BS) have smaller cluster size than those farther from BS, so in here they can preserve some energy in the time of inter-cluster data communication. Our protocol consists of cluster head selection algorithm, a cluster formation scheme and a routing algorithm for the data transmission between cluster heads and the base station. Findings: Each sensor node should effectively handle its energy in order to keep the WSN at its operation state. In each time duration Q-leach is consume more energy than the CAERP. CAERP eliminate the initial dead node problem. During the initial stage the message overhead between the Q-Leach and CAERP have somewhat similar, but after the uneven clustering formation the CAERP message overhead is reduced comparing with the Q-LEACH. In CAERP protocol it mainly focuses for utilizing the energy in efficient way. This improvement is accomplished because the nodes remain alive due to the efficient way of cluster arrangement. CAERP has mainly five cluster Head so each cycle the Cluster Head varying based on the CAERP CH selection algorithm. Due to efficient CH selection algorithm the CAERP have high network life time compared to Q-LEACH. The simulation result shows that CAERP significantly increasing the network lifetime and minimizes energy consumption of nodes compared with Q-leach protocol. Conclusion: The performance of the proposed protocol is compared with that of Q-LEACH using different parameters with the help network simulators. Our protocol CAERP has significantly improved in average energy consumption, survival rate and the extended the network life cycle which means the energy efficiency of the CAERP network is improved.

44 citations

Network Information
Related Topics (5)
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Network packet
159.7K papers, 2.2M citations
92% related
Wireless sensor network
142K papers, 2.4M citations
92% related
Wireless network
122.5K papers, 2.1M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202210
20211
20193
201822
2017264