Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks

被引:47
作者
Akkaya, K. [1 ]
Janapala, S. [1 ]
机构
[1] So Illinois Univ, Dept Comp Sci, Carbondale, IL 62901 USA
关键词
Actor coverage; Actor connectivity; Actor relocation; Travel distance; Spanning tree;
D O I
10.1016/j.comnet.2008.06.009
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2779 / 2796
页数:18
相关论文
共 31 条
[1]  
ABBASI A, 2007, P IEEE LOC COMP NETW
[2]   Sink repositioning for enhanced performance in wireless sensor networks [J].
Akkaya, K ;
Younis, M ;
Bangad, M .
COMPUTER NETWORKS, 2005, 49 (04) :512-534
[3]  
AKKAYA K, 2006, P IEEE VEH TECHN C V
[4]  
AKKAYA K, 2007, P 26 IEEE INT PERF C
[5]  
AKKAYA K, 2008, P IEEE WIR COMM NETW
[6]  
Akyildiz I. F., 2004, AD HOC NETW, V2, P351, DOI DOI 10.1016/J.ADH0C.2004.04.003
[7]  
[Anonymous], HDB COMPUTATIONAL GE
[8]  
[Anonymous], SPANNING TREES OPTIM
[9]   Movement control algorithms for realization of fault-toleront ad hoc robot networks [J].
Basu, P ;
Redi, J .
IEEE NETWORK, 2004, 18 (04) :36-44
[10]  
BATALIN MA, 2002, P INT S DISTR AUT RO