• DocumentCode
    2333449
  • Title

    Delay Tolerant Event Collection in Sensor Networks with Mobile Sink

  • Author

    Xu, Xing ; Luo, Ji ; Zhang, Qian

  • Author_Institution
    Hong Kong Univ. of Sci. & Technol., Hong Kong, China
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    We are interested in event collection in a 2D region where sensors are deployed to detect and collect interested events. Using traditional multi-hop routing in wireless sensor networks to report events to a sink node or base station, will result in severe imbalanced energy consumption of static sensors. In addition, full connectivity among all the static sensors may not be possible in some cases since generally the sensors are randomly deployed in the target region. In this paper, we exploit a mobile sensor as the sink node to assist the event collection by controlling the movement of the mobile sink to collect static sensor readings. A key observation of our work is that an event has spatial-temporal correlation. Specifically, the same event can be detected by multiple nearby sensors within a period of time. Thus, it is more energy-efficient if the mobile sink can selectively communicate with only a portion of static sensors, while still collecting all the interested events. In this paper, we discuss the event collection problem by leveraging the mobility of the sink node and the spatial-temporal correlation of the event, in favor of maximizing the network lifetime with a guaranteed event collection rate. We first model the problem as sensor selection problem and show that it could be solved in polynomial time, if global knowledge of events is available and there is no velocity constraints on mobile sink. We also analyze the design of a feasible movement route for mobile sink to minimize the velocity requirements for a practical system. An online scheme is then proposed to relax the assumption about global knowledge of events and we prove that the expected event collection rate can be guaranteed in theory. Through comprehensive simulation on real trace data, we demonstrate that the network lifetime can be significantly extended, comparing to some other schemes.
  • Keywords
    communication complexity; energy consumption; mobile radio; telecommunication network routing; wireless sensor networks; base station; delay tolerant event collection; energy consumption; mobile sensor; mobile sink; multihop routing; network lifetime; polynomial time; sensor selection problem; spatial-temporal correlation; static sensors; wireless sensor networks; Base stations; Disruption tolerant networking; Energy consumption; Event detection; Intelligent sensors; Monitoring; Peer to peer computing; Routing; Spread spectrum communication; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2010 Proceedings IEEE
  • Conference_Location
    San Diego, CA
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-5836-3
  • Type

    conf

  • DOI
    10.1109/INFCOM.2010.5462075
  • Filename
    5462075