Name
Abstract | ||
|---|---|---|
Hidden nodes cause unexpected collisions and interferences in mobile ad-hoc networks (MANETs). However, little attention has been given to the behavior of hidden nodes, especially when channels are under random bit errors. Exchanging RTS/CTS can avoid hidden node problems. However, undesirable overheads in every packet cause performance degradation, and this motivates many researchers to design new algorithms with modification of the IEEE 802.11 standard. In this paper, the impact of hidden nodes is thoroughly modeled using Markov chains. This model incorporates critical network parameters (random bit errors, packet lengths, number of users) in noisy MANETs channels. Through rigorous analysis, the study suggests the optimal packet lengths to be used in various channel conditions with the existence of hidden nodes. These optimal fragments effectively reduce the number of retransmissions caused by collisions from hidden nodes and corrupted packets due to random bit errors, which significantly improves throughput in noisy MANETs channels without modification of the standards. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CCNC.2012.6181084 | 2012 IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE (CCNC) |
Keywords | Field | DocType |
Fragmentation, hidden terminal problem, random bit error, mobile ad-hoc network, IEEE 802.11 MAC | Computer science,Network packet,Markov chain,Computer network,Communication channel,Throughput,Wireless ad hoc network,Hidden node problem,IP fragmentation,Bit error rate,Distributed computing | Conference |
ISSN | Citations | PageRank |
2331-9852 | 4 | 0.39 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sungjin Park | 1 | 64 | 19.94 |
| Yusun Chang | 2 | 73 | 9.02 |
| John A. Copeland | 3 | 456 | 60.84 |