scholarly journals Cross-Layer Path Configuration for Energy-Efficient Communication over Wireless Ad Hoc Networks

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Hong-Chuan Yang ◽  
Kui Wu ◽  
Wu-Sheng Lu
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Optimization Problems ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Battery Capacity ◽  
Hoc Networks

We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ) mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

scholarly journals A Stable Backup Routing Protocol for Wireless Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6743
Author(s):  
Fan Zhang ◽  
Gangqiang Yang
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
High Speed ◽  
Ad Hoc ◽  
Path Selection ◽  
Delivery Ratio ◽  
Average Delay ◽  
Heavy Load ◽  
Packet Delivery ◽  
Hoc Networks

High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.

Node Cooperation to Avoid Early Congestion Detection Based on Cross-Layer for Wireless Ad Hoc Networks

2016 ◽  
Vol 6 (5) ◽  
pp. 2322
Author(s):  
Abdalrazak Tareq Rahem ◽  
Mahamod Ismail ◽  
Nor Fadzilah Abdullah ◽  
Mohammed Balfaqih
Keyword(s):  
Ad Hoc Networks ◽  
Congestion Control ◽  
Wireless Ad Hoc Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Effective Control ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Node Cooperation ◽  
Hoc Networks

<p><span>The resent application of wireless ad hoc networks (WANET) demands a high and reliable data load. The simultaneous transfer of large amounts of data different nearby sources to nearby destinations in a massive network under these circumstances results in the possibility of network congestion. Congestion is an extremely unwanted condition because it creates extra overhead to the already deeply loaded environment, which ultimately leads to resource exhaustion, and can lead to packet drops and retransmission at either the MAC or upper layers. We present a lightweight congestion control and early avoidance congestion control scheme, which can effective control congestion while keeping overhead to a minimum. This scheme is based on the Cross-layer between the MAC and network layers lead to early detection of congestion. With the help of node cooperation the sender node is triggered to find an alternative route based on TMT. This mechanism controls the network resources rather than the data traffic. Detailed performance results show enhancement in the throughput and packet delivery ratio, as well as a reduction in packet drop. Generally, network performance increases.</span></p>

scholarly journals Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Noor Mast ◽  
Muhammad Altaf Khan ◽  
M. Irfan Uddin ◽  
Syed Atif Ali Shah ◽  
Atif Khan ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Source Node ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Intermediate Node ◽  
Packet Delivery ◽  
Hoc Networks

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.

scholarly journals Node Cooperation to Avoid Early Congestion Detection Based on Cross-Layer for Wireless Ad Hoc Networks

2016 ◽  
Vol 6 (5) ◽  
pp. 2322
Author(s):  
Abdalrazak Tareq Rahem ◽  
Mahamod Ismail ◽  
Nor Fadzilah Abdullah ◽  
Mohammed Balfaqih
Keyword(s):  
Ad Hoc Networks ◽  
Congestion Control ◽  
Wireless Ad Hoc Networks ◽  
Network Performance ◽  
Ad Hoc ◽  
Effective Control ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Node Cooperation ◽  
Hoc Networks

<p><span>The resent application of wireless ad hoc networks (WANET) demands a high and reliable data load. The simultaneous transfer of large amounts of data different nearby sources to nearby destinations in a massive network under these circumstances results in the possibility of network congestion. Congestion is an extremely unwanted condition because it creates extra overhead to the already deeply loaded environment, which ultimately leads to resource exhaustion, and can lead to packet drops and retransmission at either the MAC or upper layers. We present a lightweight congestion control and early avoidance congestion control scheme, which can effective control congestion while keeping overhead to a minimum. This scheme is based on the Cross-layer between the MAC and network layers lead to early detection of congestion. With the help of node cooperation the sender node is triggered to find an alternative route based on TMT. This mechanism controls the network resources rather than the data traffic. Detailed performance results show enhancement in the throughput and packet delivery ratio, as well as a reduction in packet drop. Generally, network performance increases.</span></p>

Performance Analysis of TCP Variants using AODV and DSDV Routing Protocols in MANETs

2019 ◽  
Vol 13 ◽  
Author(s):  
Rajnesh Singh ◽  
Neeta Singh ◽  
Aarti Gautam Dinker
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Transport Layer ◽  
Destination Node ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Two Measures ◽  
Hoc Networks

TCP is the most reliable transport layer protocol that provides reliable data delivery from source to destination node. TCP works well in wired networks but it is assumed that TCP is less preferred for ad-hoc networks. However, for application in ad-hoc networks, TCP can be modified to improve its performance. Various researchers have proposed improvised variants of TCP by only one or two measures. These one or two measures do not seem to be sufficient for proper analysis of improvised version of TCP. So, in this paper, the performance of different TCP versions is investigated with DSDV and AODV routing Protocols. We analyzed various performance measures such as throughput, delay, packet drop, packet delivery ratio and number of acknowledgements. The simulation results are carried out by varying number of nodes in network simulator tool NS2. It is observed that TCP Newreno achieved higher throughput and packet delivery ratio with both AODV and DSDV routing protocols.Whereas TCP Vegas achieved minimum delay and packet loss with both DSDV and AODV protocol. However TCP sack achieved minimum acknowledgment with both AODV and DSDV routing protocols. In this paper the comparison of all these TCP variants shows that TCP Newreno provides better performance with both AODV and DSDV protocols.

Sign in / Sign up

Export Citation Format

Share Document