RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks
Geographical routing mechanisms were widely used in wireless sensor networks(WSN),by which data packets could be routed to the destination sensor node through a small amount of local routing information.Geographic routing algorithms usually required planar graphs derived the original network topolog...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)05-0029-09/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539906171568128 |
|---|---|
| author | Xiao-lin FANG Hong GAO Shu-guang XIONG |
| author_facet | Xiao-lin FANG Hong GAO Shu-guang XIONG |
| author_sort | Xiao-lin FANG |
| collection | DOAJ |
| description | Geographical routing mechanisms were widely used in wireless sensor networks(WSN),by which data packets could be routed to the destination sensor node through a small amount of local routing information.Geographic routing algorithms usually required planar graphs derived the original network topologies.However,most planarization algorithms assumed a fixed communication radius of the sensor nodes,which mismatched real applications.The only practical algorithm brought in overheads in delet g and adding cross links.To provide a solution to the problem of existing algorithms,RPR (region partitioning-based routing) was introduced.RPR was a high-reliable and low-cost geographic routing protocol,which divided the whole network into of regular regions,and tried to perform a region-greedy routing on the virtual node of a region when th node-greedy routing failed.RPR had high reliability since the transmissions between regions could reduce the average length of the routing paths.Furthermore,RPR had low cost because its planarization phase did not check or delete cross links.Experiments show that RPR performs better than existing algorithms. |
| format | Article |
| id | doaj-art-70a28cb8845a468cbe5b5da64f57de53 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-70a28cb8845a468cbe5b5da64f57de532025-01-14T06:31:48ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-05-0133293759661939RPR:high-reliable low-cost geographical routing protocol in wireless sensor networksXiao-lin FANGHong GAOShu-guang XIONGGeographical routing mechanisms were widely used in wireless sensor networks(WSN),by which data packets could be routed to the destination sensor node through a small amount of local routing information.Geographic routing algorithms usually required planar graphs derived the original network topologies.However,most planarization algorithms assumed a fixed communication radius of the sensor nodes,which mismatched real applications.The only practical algorithm brought in overheads in delet g and adding cross links.To provide a solution to the problem of existing algorithms,RPR (region partitioning-based routing) was introduced.RPR was a high-reliable and low-cost geographic routing protocol,which divided the whole network into of regular regions,and tried to perform a region-greedy routing on the virtual node of a region when th node-greedy routing failed.RPR had high reliability since the transmissions between regions could reduce the average length of the routing paths.Furthermore,RPR had low cost because its planarization phase did not check or delete cross links.Experiments show that RPR performs better than existing algorithms.http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)05-0029-09/wireless sensor networksgeographical routingplanar graphregion partition |
| spellingShingle | Xiao-lin FANG Hong GAO Shu-guang XIONG RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks Tongxin xuebao wireless sensor networks geographical routing planar graph region partition |
| title | RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks |
| title_full | RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks |
| title_fullStr | RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks |
| title_full_unstemmed | RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks |
| title_short | RPR:high-reliable low-cost geographical routing protocol in wireless sensor networks |
| title_sort | rpr high reliable low cost geographical routing protocol in wireless sensor networks |
| topic | wireless sensor networks geographical routing planar graph region partition |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)05-0029-09/ |
| work_keys_str_mv | AT xiaolinfang rprhighreliablelowcostgeographicalroutingprotocolinwirelesssensornetworks AT honggao rprhighreliablelowcostgeographicalroutingprotocolinwirelesssensornetworks AT shuguangxiong rprhighreliablelowcostgeographicalroutingprotocolinwirelesssensornetworks |