Authors:
Jeongcheol Lee
;
Hosung Park
;
Seungmin Oh
;
Yongbin Yim
and
Sang-Ha Kim
Affiliation:
Chungnam National University, Korea, Republic of
Keyword(s):
Wireless Sensor Networks, Beaconless Routing, Geographic Routing.
Related
Ontology
Subjects/Areas/Topics:
Embedded Communications Systems
;
Sensors and Sensor Networks
;
Telecommunications
Abstract:
Many beaconless geographic routing protocols have been proposed in the wireless sensor networks, and they could avoid the hidden problem by adopting restricted forwarding area, which is nested in the greedy area and includes only mutually communicable nodes. However, these protocols are designed for uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. If voids or hotspots are in the restricted small area, these restricted region-based approaches would be failed to find a forwarding node even if there exist appropriate candidates in the rest area. In this paper, we propose a beaconless geographic routing protocol to increase forwarding opportunities for practical sensor networks. By giving different contention priorities into the mutually communicable nodes and the rest nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication.