Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks

被引:5
作者
Xu, Zhezhuang [1 ]
Liu, Guanglun [1 ]
Yan, Haotian [2 ]
Cheng, Bin [3 ]
Lin, Feilong [4 ]
机构
[1] Fuzhou Univ, Sch Elect Engn & Automat, Fuzhou 350116, Fujian, Peoples R China
[2] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong Kong 999077, Hong Kong, Peoples R China
[3] Rutgers State Univ, Wireless Informat Network Lab WINLAB, North Brunswick, NJ 08902 USA
[4] Zhejiang Normal Univ, Coll Math Phys & Informat Engn, Jinhua 321004, Peoples R China
关键词
trail-based search; event report transmission; mobility management; routing; wireless sensor and actor networks; ROUTING PROTOCOL; LOCATION SERVICE;
D O I
10.3390/s17112468
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.
引用
收藏
页数:21
相关论文
共 27 条
  • [1] Akyildiz I. F., 2004, Ad Hoc Networks, V2, P351, DOI DOI 10.1016/J.ADH0C.2004.04.003
  • [2] [Anonymous], P IEEE INT C MOB AD
  • [3] Ben Hamida E, 2008, IEEE ICC, P2201
  • [4] A Biased Random Walk Routing Protocol for Wireless Sensor Networks: The Lukewarm Potato Protocol
    Beraldi, Roberto
    Baldoni, Roberto
    Prakash, Ravi
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2010, 9 (11) : 1649 - 1661
  • [5] A survey of mobility models for ad hoc network research
    Camp, T
    Boleng, J
    Davies, V
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2002, 2 (05) : 483 - 502
  • [6] Controlled flooding search in a large network
    Chang, Nicholas B.
    Liu, Mingyan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (02) : 436 - 449
  • [7] Chatterjee Paroma, 2015, 2015 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT). Proceedings, P1, DOI 10.1109/ISGT.2015.7131883
  • [8] On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
    Das, Saumitra M.
    Pucha, Himabindu
    Hu, Y. Charlie
    [J]. COMPUTER NETWORKS, 2007, 51 (13) : 3693 - 3714
  • [9] Fan X., 2012, 1 P IEEE INT C COMM, P1
  • [10] Hasslinger G, 2009, LECT NOTES COMPUT SC, V5793, P42, DOI 10.1007/978-3-642-04383-3_4