Routing in wireless ad hoc networks

Rishiwal, Vinay; Yadav, Mano

doi:10.1504/ijipt.2012.050221

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CARM protocol introduces a new parameter called weighted channel delay (WCD) to measure congestion level and adopts a route effective link data-rate category (ELDC) to avoid the mismatched data-rate route problem. Rishiwal and Yadav (2012) proposed a routing strategy that finds a path to be followed by packets from a source node to a destination node used in traditional wired networks cannot be directly applied in ad hoc wireless networks due to their highly dynamic topology, absence of established infrastructure for centralised administration, bandwidth constrained wireless links and energy constrained nodes. Congestion-aware distance vector (CADV) [20] is based on distance to the destination as well as the expected delay at the next hop showed in CADV gives the routes with low expected delay, higher priority.…”

Section: Literature Surveymentioning

confidence: 99%

Congestion aware multi-path routing protocol for mobile ad-hoc networks

Bhardwaj

Kant

2015

IJCONVC

View full text Add to dashboard Cite

We propose a congestion-based extension to existing multipath routing protocol AOMDV (CA-AOMDV). AOMDV is based on minimum number of hops count between source and destination nodes and is not suitable for real time applications because of its high end to end delay, jitter and packet loss. CA-AOMDV selects a least congested path instead of minimum number of hops between source and destination nodes. CA-AOMDV performs well under high load and varying mobility conditions. In CA-AOMDV, end to end delay is improved by 20%-80%, jitter is reduced by 25%-47%, routing overheads is reduced by 40%-70%. CA-AOMDV performs better than AOMDV in real time applications.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Congestion aware multi-path routing protocol for mobile ad-hoc networks

Bhardwaj

Kant

2015

IJCONVC

View full text Add to dashboard Cite

show abstract

“…al [13] in his work titled "Power Aware Routing in Ad Hoc Wireless Networks" they propose an efficient algorithm and maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As on their case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithm's performance is enhanced as compare to AODV and DSR in terms of various energy base parameters like total Energy Consumption, Average Energy Left Per Alive Node, Node Termination Rate, and Network Lifetime for different network scenarios.…”

Section: Related Workmentioning

confidence: 99%

Prolong the Life time of Network using Minimum Energy Consumption in MANET

KumarRinhayat¹,

Jain²,

Chandravanshi³

2014

IJCA

View full text Add to dashboard Cite

Mobile Ad hoc network (MANET) are self-configuring, individual nodes or routers networks that move about freely, organize themselves randomly and are interconnected through wireless links that when synchronized, form a dynamic topology. The nodes in required battery power for communication and it is very crucial matter to utilize the battery power of nodes efficiently in network. The battery replacement and charging is not possible in that kind of network and the insufficient battery lifetime imposes a limitation on the network performance. To take full utilization of the lifetime of nodes, traffic should be routed in a way that energy consumption is minimized. The energy efficient routing is improves the battery life and routing capability of nodes. In this research we proposed a new energy efficient routing scheme with AODV routing protocol to improve the reliability of data delivery and energy utilization. The proposed scheme is efficiently utilizes the energy of mobile nodes through variation in the energy of nodes on the basis of their radio range in network utilization. It means the nodes are only communicate to nearest neighbor by that the less amount of transmission and receiving energy is required for communication. In this approach the proposer energy utilization and consumption is possible that reduces the improper energy depletion of mobile nodes. The routing performance is measured through performance matrices and the proposed scheme is showing the much better performance as compare to normal energy routing with AODV routing protocol.

show abstract