Efficient Selection of Multipoint Relays in Wireless Ad Hoc Networks with Realistic Physical Layer
AINTEC '07 Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet
Journal of Network and Computer Applications
BoSS: a moving strategy for mobile sinks in wireless sensor networks
International Journal of Sensor Networks
Routing strategies in multihop cooperative networks
IEEE Transactions on Wireless Communications
Voice communication over mobile ad hoc networks: evaluation of a QoS extension of OLSR using OPNET
AINTEC '09 Asian Internet Engineering Conference
Overhearing-aware joint routing and rate selection in multi-hop multi-rate UWB-based WPANs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Accuracy of link status detection in wireless multi-hop networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Cross-layer design for efficient resource utilization in wimedia UWB-based WPANs
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A multiple path characterization of ad-hoc network capacity
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Routing protocol design guidelines for smart grid environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.25 |
We present guidelines on how to design network layer protocols when the unit disk graph (UDG) model is replaced by a more realistic physical layer model. Instead of merely using the transmission radius in the UDG model, physical, MAC, and network layers share the information about a bit and/or packet reception probability as a function of distance between nodes. We assume that all nodes use the same transmission power for sending messages, and that a packet is received when all its bits are correctly received. The MAC layer reacts to this probabilistic reception information by adjusting the number of acknowledgments and/or retransmissions. We observe that an optimal route discovery protocol cannot be based on a single retransmission by each node, because such a search may fail to reach the destination or find the optimal path. Next, we discuss that gaining neighbor knowledge information with "hello" packets is not a trivial protocol. We describe localized position-based routing protocols that aim to minimize the expected hop count (in case of hop-by-hop acknowledgments and fixed bit rate) or maximize the probability of delivery (when acknowledgments are not sent). We propose a guideline for the design of greedy position-based routing protocols with known destination locations. The node currently holding the message forwards it to a neighbor (closer to the destination than itself) that minimizes the ratio of cost over progress, where the cost measure depends on the assumptions and metrics used, while the progress measures the difference in distances to the destination. We consider two basic medium access layer approaches, with fixed and variable packet lengths. This article serves as a preliminary contribution toward the development of network layer protocols that match the assumptions and criteria already used in simulators and ultimately in real equipment.