1 / 16

An Efficient Data-Driven Routing Protocol for Wireless Sensor Networks with Mobile Sinks

An Efficient Data-Driven Routing Protocol for Wireless Sensor Networks with Mobile Sinks. Lei Shi , Baoxian Zhang , Kui Huang , Jian Ma , Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Sciences. 고려대학교 박사과정 2 학기 이 기원 2011. 12. 08.

ismail
Download Presentation

An Efficient Data-Driven Routing Protocol for Wireless Sensor Networks with Mobile Sinks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Efficient Data-Driven Routing Protocol for Wireless Sensor Networks with Mobile Sinks Lei Shi , Baoxian Zhang , Kui Huang , Jian Ma , Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Sciences 고려대학교 박사과정 2학기 이 기원 2011. 12. 08

  2. Contents • Introduction • Motivation • Data-Driven Routing Protocol • protocol overview • protocol design • Simulation • Conclusion

  3. Introduction (1/2) • Mobile sinks into Wireless Sensor Networks (WSN) • several advantages such as hotspot removal and energy use optimizations • However, sink mobility can cause unexpected changes of network topology • bring excessive protocol overhead for route discovery and maintenance • How the routing protocol can be designed to keep high data delivery ratio while suppressing the protocol overhead caused by sink mobility?

  4. Introduction (2/2) • Existing work on design of routing protocols for mWSNs can be divided into two types • use mobile collectors for data gathering • sensor node only reports its sensed data when a mobile collector is in its communication range • cause little communication overhead, but often result in long delivery latency (e.g., a few hours or even days) and large storage overhead at sensor nodes!! • use mobile sinks such that a sensor can report its sensed data via a multi-hop path • this paper belonging to this type

  5. Motivation • Effectively reduce the protocol overhead for data gathering in wireless sensor networks • DDRP integrates data-driven packet forwarding and random walk • exploits the broadcast feature of wireless transmissions for gratuitous route learning • Each data packet needs to carry an additional option recording the known distance from the sender to the target mobile sink • continuous such route-learning will provide route information for more and more sensor nodes in the network

  6. Data-Driven Routing Protocol • Each mobile sink broadcasts beacon messages periodically to its one-hop neighboring sensor nodes • Beacon message carries the following information • the ID of the mobile sink • time stamp • beacon interval • Each data packet carries an option, Dist2mSink • records the shortest known distance from the sender of the packet to a mobile sink • maximum allowed value of Dist2mSink is set as K • K+1 means infinity

  7. Data-Driven Routing Protocol • Sensor nodes in the network is divided into three types • One-hop neighboring sensor nodes of mobile sinks (OHS) • Multihop neighboring sensor nodes of mobile sinks (MHS) • Infinite-hop neighboring sensor nodes of mobile sinks (IHS) • No route to reach a mobile sink • Different types of sensors will have different procedures for route learning

  8. Data-Driven Routing Protocol • In DDRP, the procedures for data gathering mainly contain the following four components • how OHS, MHS, IHS nodes create and update their routing tables • how data packets are forwarded to reach a mobile sink in DDRP • Routing entry at a sensor has the following information • HopDist : the distance to a sink (invalid entry, INFINITY) • NextHopID : the ID of next-hop to reach a sink • ExpireTime : the time when the current entry will expire if no further update received • In DDRP, each node at most keeps two routing entries. One is the working entry and the other is for backup purpose

  9. Data-Driven Routing Protocol → The state transition graph among node states How sensors may transit among different types

  10. DDRP Design • Data Packet Forwarding • OHS node : the data packets are forwarded directly to the mobile sink • MHS node : it selects a routing entry with shorter distance to mobile sink to forward the packet • IHS node : random walk is triggered

  11. Simulation Scenario (1/2) • Implemented in NS-2 • Compare the performance of DDRP, AVRP, TRAIL, and random walk • 200 sensor nodes and multiple mobile sinks were deployed uniformly at random initially in a 500×500 m2 square area • The MAC protocol used is IEEE 802.15.4 • The size of data packets and that of control packets are both 40 bytes

  12. Simulation Scenario (2/2) • Two metrics to evaluate the performance of DDRP • Forwarding overhead • ratio of the total number of all packets transmitted to the number of successfully delivered data packets • Packet delivery success ratio • ratio of the total number of data packets successfully received by sinks • Impact of Traffic Load

  13. Simulation Results(1/2)

  14. Simulation Results(2/2)

  15. Conclusion • This paper designed DDRP • data-driven routing protocol for wireless sensor networks with mobile sinks • Simulation results demonstrate that • reduce the protocol overhead compared with existing work • keep high packet delivery ratio under different scenarios

  16. Reference [1] L. Shi, B. Zhang, K. Huang, and J. Ma, “An Efficient Data-Driven Routing Protocol for Wireless Sensor Networks with Mobile Sinks,” In Proc. IEEE ICC’11, June 2011. [2] F. Ye, H. Y. Luo, J. Cheng, S.W. Lu, and L.X. Zhang, “A two-tier data dissemination model for large-scale wireless sensor networks,” In Proc. ACM MobiCom’02, September 2002.

More Related