TY - GEN
T1 - A small world based routing approach of heterogeneous strategy in the internet of things
AU - Liu, Wenmao
AU - Fang, Binxing
AU - Yin, Lihua
AU - Zhang, Hongli
PY - 2011
Y1 - 2011
N2 - RFID readers of various organizations deployed in the Internet of Things environment are interconnected for service data relay, however heterogeneous readers' forward strategies increases routing failure and routing overhead. Our main contribution is to propose a novel small world based routing protocol. Distributed hubs are generated by shared peer statuses so that a logical small world is constructed. Hence a long-distance route path is split to a proactive short intra-clique segment, a proactive long inter-clique segment and a reactive short intra-clique segment. The proactive segments are logically shortened by hub strategy exchange, therefore routing discover overhead is greatly reduced; intermediate nodes select a path to the destination hub with the greatest utility function so that the reachability of recent data flow is guaranteed. Moreover, a tagged-AODV routing protocol is employed in intra-clique routing to avoid routing failure caused by restrict strategies. Our simulation results show that the tagged small world approach is efficient in dynamic networks, compared to regular AODV and tagged-AODV protocols it reduces routing overhead and improves routing success rate significantly.
AB - RFID readers of various organizations deployed in the Internet of Things environment are interconnected for service data relay, however heterogeneous readers' forward strategies increases routing failure and routing overhead. Our main contribution is to propose a novel small world based routing protocol. Distributed hubs are generated by shared peer statuses so that a logical small world is constructed. Hence a long-distance route path is split to a proactive short intra-clique segment, a proactive long inter-clique segment and a reactive short intra-clique segment. The proactive segments are logically shortened by hub strategy exchange, therefore routing discover overhead is greatly reduced; intermediate nodes select a path to the destination hub with the greatest utility function so that the reachability of recent data flow is guaranteed. Moreover, a tagged-AODV routing protocol is employed in intra-clique routing to avoid routing failure caused by restrict strategies. Our simulation results show that the tagged small world approach is efficient in dynamic networks, compared to regular AODV and tagged-AODV protocols it reduces routing overhead and improves routing success rate significantly.
UR - https://www.scopus.com/pages/publications/84860544445
U2 - 10.1109/ICCSNT.2011.6182146
DO - 10.1109/ICCSNT.2011.6182146
M3 - 会议稿件
AN - SCOPUS:84860544445
SN - 9781457715846
T3 - Proceedings of 2011 International Conference on Computer Science and Network Technology, ICCSNT 2011
SP - 1072
EP - 1076
BT - Proceedings of 2011 International Conference on Computer Science and Network Technology, ICCSNT 2011
T2 - 2011 International Conference on Computer Science and Network Technology, ICCSNT 2011
Y2 - 24 December 2011 through 26 December 2011
ER -