Context-aware geographic routing for sensor networks with routing holes

Authors:
Jiaxi You;Dominik Lieckfeldt;Frank Reichenbach;Dirk Timmermann
Affiliations:
University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 7
Cited 2

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
Wireless Sensor Networks: An Information Processing Approach

Wireless Sensor Networks: An Information Processing Approach
The holes problem in wireless sensor networks: a survey

ACM SIGMOBILE Mobile Computing and Communications Review
Protocols and Architectures for Wireless Sensor Networks

Protocols and Architectures for Wireless Sensor Networks
A conceptual framework and a toolkit for supporting the rapid prototyping of context-aware applications

Human-Computer Interaction

Virtual position based geographic routing for wireless sensor networks

Computer Communications
A hole detour scheme using virtual position based on residual energy for wireless sensor networks

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern sensor networks are deployed in various terrains of interest. As the complexity of their deployed areas is growing, existing geographic routing algorithms are facing challenges. Holes in networks often cause failures in message routing. Energy consumption, scalability, and routing efficiency are also key design challenges. In this paper, we propose a novel geographic routing algorithm called HOle-BYpassing routing with Context-AwareNess (HobyCan). Our approach locally sets up multiple detour paths to bypass almost all kinds of holes. Therefore, contours of holes are extended with multiple detour paths. According to various context information of a sensor network, such as the size of holes or the remaining energy of nodes, disjoint detour paths can be used alternatively to achieve optimal routing paths or load balance of the network. Simulation results demonstrate the performance of our algorithm, as well as the significance of context information as routing parameters.