Adaptive Probabilistic Broadcasting over Dense Wireless Ad Hoc Networks

We propose an idle probability-based broadcasting method,iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense wireless ad hoc networks. In multisource one-hop broadcast scenarios, the modeling and simulation results of the proposediProare shown to significantly outperform the standard IEEE 802.11 under saturated condition. Moreover, the results also show that without estimating the number of competing nodes and changing the contention window size, the performance of the proposediProcan still approach the theoretical bound. We further applyiProto multihop broadcasting scenarios, and the experiment results show that within the same elapsed time after the broadcasting, the proposediProhas significantly higher Packet-Delivery Ratios (PDR) than traditional methods.

Download Full-text

A simple recursive scheme for adjusting the contention window size in IEEE 802.11e wireless ad hoc networks

Computer Communications ◽

10.1016/j.comcom.2006.06.016 ◽

2006 ◽

Vol 29 (18) ◽

pp. 3789-3803 ◽

Cited By ~ 5

Author(s):

Hassan Artail ◽

Haidar Safa ◽

Joe Naoum-Sawaya ◽

Bissan Ghaddar ◽

Sami Khawam

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Window Size ◽

Contention Window ◽

Ieee 802.11E ◽

Recursive Scheme ◽

Contention Window Size ◽

Hoc Networks

Download Full-text

Contention Window Size Control for QoS Support in Multi-hop Wireless Ad Hoc Networks

Management Enabling the Future Internet for Changing Business and New Computing Services - Lecture Notes in Computer Science ◽

10.1007/978-3-642-04492-2_27 ◽

2009 ◽

pp. 261-272

Author(s):

Pham Thanh Giang ◽

Kenji Nakagawa

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Size Control ◽

Window Size ◽

Contention Window ◽

Contention Window Size ◽

Hoc Networks

Download Full-text

A Stable Backup Routing Protocol for Wireless Ad Hoc Networks

Sensors ◽

10.3390/s20236743 ◽

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.

Download Full-text

Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks

IEEE Transactions on Wireless Communications ◽

10.1109/twc.2010.02.081057 ◽

2010 ◽

Vol 9 (2) ◽

pp. 662-673 ◽

Cited By ~ 43

Author(s):

Alfred Asterjadhi ◽

Elena Fasolo ◽

Michele Rossi ◽

Joerg Widmer ◽

Michele Zorzi

Keyword(s):

Ad Hoc Networks ◽

Network Coding ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Data Broadcasting ◽

Hoc Networks

Download Full-text

Modifying the IEEE 802.11 MAC to improve performance of multiple broadcasting of multimedia data in wireless ad-hoc networks

International Journal of Advanced Computer Science and Applications ◽

10.14569/specialissue.2013.030409 ◽

2013 ◽

Vol 3 (4) ◽

Author(s):

Christos Chousidis ◽

Rajagopal Nilavalan

Keyword(s):

Ad Hoc Networks ◽

Ieee 802.11 ◽

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Multimedia Data ◽

Improve Performance ◽

Ieee 802.11 Mac ◽

Hoc Networks ◽

802.11 Mac

Download Full-text

Modeling and Analyzing the Optimal Contention Window Size for Distributed Synchronization in Ad Hoc Networks

IEEE Communications Letters ◽

10.1109/lcomm.2016.2633247 ◽

2017 ◽

Vol 21 (2) ◽

pp. 390-393 ◽

Cited By ~ 1

Author(s):

Lei Lei ◽

Shengsuo Cai ◽

Xiaoming Chen ◽

Xiaoqin Song

Keyword(s):

Ad Hoc Networks ◽

Ad Hoc ◽

Window Size ◽

Contention Window ◽

Contention Window Size ◽

Distributed Synchronization ◽

Hoc Networks

Download Full-text

Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

Complexity ◽

10.1155/2021/2051796 ◽

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%.

Download Full-text

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

Advances in Multimedia ◽

10.1155/2007/19860 ◽

2007 ◽

Vol 2007 ◽

pp. 1-9 ◽

Cited By ~ 5

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.

Download Full-text