Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Minimizing recovery state In geographic ad-hoc routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
Improving wireless simulation through noise modeling
Proceedings of the 6th international conference on Information processing in sensor networks
R-MAC: Reservation Medium Access Control Protocol for Wireless Sensor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Opportunity-Based Topology Control in Wireless Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Greedy Geographic Routing Algorithms in Real Environment
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
NAS '10 Proceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage
Rethinking multi-channel protocols in wireless sensor networks
Proceedings of the 6th Workshop on Hot Topics in Embedded Networked Sensors
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In greedy routing, each relay node forwards the message to a neighbor (also called the successor) that is closer to the destination. However, the successor candidate set (SCS) is different every time the relative location of the relay node to the destination changes. The configuration in the entire network, when all succeeding paths from a relay node are blocked by local minima, is irregular and its concern region cannot be determined unless the routing actually initiates. In the real deployment environment of the wireless ad hoc networks, the link quality also changes dynamically. This brings a challenge for the local decision of the greedy advance to precisely adjust its SCS for the flip-flop of link quality that blocks the non-detour path ahead. This paper introduces a new information model to a non-detour routing, also called progressive routing, under the impact of dynamic blocks. As a result, each 1-hop advance, by sacrificing little routing flexibility, can avoid those unsafe situations and remains on a non-detour path. In our model, each node prepares the information in a proactive mode, but can use it for all different paths passing through, saving the cost and delay in the reactive mode. We focus on an ''everyone'' model, in which each node will apply the same generic process in a fully distributed manner, in order to achieve a scalable and reliable solution. In detail, we discuss how in a sample realistic environment the pattern of SCS can be interpreted in a single safety descriptor @?[0,1] at each node. It indicates the maximum probability of a successful non-detour path from this node to the edge of networks. The larger value the more likely the non-detour routing will be successful and the more stable the path will be. We illustrate the effectiveness of this indirect reference information in the corresponding routing in terms of the success of non-detour path constitution and the ability of self-adjustment for dynamics in the networks, while the cost of information construction and update propagation is minimized. The results are compared with the best results known to date.