Limits...
Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

Lee J, Park H, Kang S, Kim KI - Sensors (Basel) (2015)

Bottom Line: Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community.Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids.To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science, University of California, Los Angeles, CA 90095, USA. jclee0333@gmail.com.

ABSTRACT
Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

No MeSH data available.


Related in: MedlinePlus

An example of the beaconless recovery forwarding scheme.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4507634&req=5

f6-sensors-15-13222: An example of the beaconless recovery forwarding scheme.

Mentions: For example, as shown in Figure 6, b, f and h receive the FORWARDING_QUERY message from c, g and e, respectively. The b and f are in the proximity region of c and g, and b protest against c, as well as f protests against g. Therefore, the sender S could get a planar subgraph for face routing by eliminating violated edges. The selected next-hop forwarder would receive FORWARDING_PERMIT by the s.


Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

Lee J, Park H, Kang S, Kim KI - Sensors (Basel) (2015)

An example of the beaconless recovery forwarding scheme.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4507634&req=5

f6-sensors-15-13222: An example of the beaconless recovery forwarding scheme.
Mentions: For example, as shown in Figure 6, b, f and h receive the FORWARDING_QUERY message from c, g and e, respectively. The b and f are in the proximity region of c and g, and b protest against c, as well as f protests against g. Therefore, the sender S could get a planar subgraph for face routing by eliminating violated edges. The selected next-hop forwarder would receive FORWARDING_PERMIT by the s.

Bottom Line: Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community.Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids.To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science, University of California, Los Angeles, CA 90095, USA. jclee0333@gmail.com.

ABSTRACT
Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

No MeSH data available.


Related in: MedlinePlus