This Article 
 Bibliographic References 
 Add to: 
Communication and Coordination in Wireless Sensor and Actor Networks
October 2007 (vol. 6 no. 10)
pp. 1116-1129
In this paper, coordination and communication problems in Wireless Sensor and Actor Networks (WSANs) are jointly addressed in a unifying framework. A sensor-actor coordination model is proposed, based on an event-driven partitioning paradigm. Sensors are partitioned into different sets and each set is constituted by a data-delivery tree associated with a different actor. The optimal solution for the partitioning strategy is determined by mathematical programming, and a distributed solution is proposed. In addition, a new model for the actoractor coordination problem is introduced. The actor coordination is formulated as a task assignment optimization problem for a class of coordination problems in which the area to be acted upon needs to be optimally split among different actors. An auctionbased distributed solution of the problem is also presented.Performance evaluation shows how global network objectives, such as compliance with real-time constraints and minimum energy consumption, can be achieved in the proposed framework with simple interactions between sensors and actors that are suitable for large-scale networks of energy-constrained devices.

[1] I.F. Akyildiz and I.H. Kasimoglu, “Wireless Sensor and Actor Networks: Research Challenges,” Ad Hoc Networks, vol. 2, no. 4, pp. 351-367, Oct. 2004.
[2] T. Melodia, D. Pompili, and I.F. Akyildiz, “On the Interdependence of Distributed Topology Control and Geographical Routing in Ad Hoc and Sensor Networks,” J. Selected Areas in Comm., vol. 23, no. 3, pp. 520-532, Mar. 2005.
[3] W.-P. Chen, J.C. Hou, and L. Sha, “Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 258-271, July-Sept. 2004.
[4] X. Ji, H. Zha, J. Metzner, and G. Kesidis, “Dynamic Cluster Structure for Object Detection and Tracking in Wireless Ad Hoc Sensor Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '04), June 2004.
[5] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Feb. 1993.
[6] J. Czyzyk, M. Mesnier, and J. Moré, “The NEOS Server,” IEEE J. Computational Science and Eng., vol. 5, no. 3, pp. 68-75, July-Sept. 1998.
[7] R. Vedantham, Z. Zhuang, and R. Sivakumar, “Hazard Avoidance in Wireless Sensor and Actor Networks,” Computer Comm., vol. 29, nos. 13-14, pp. 2447-2736, Aug. 2006
[8] T. He, J. Stankovic, C. Lu, and T. Abdelzaher, “SPEED: A Real-Time Routing Protocol for Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '03), pp. 46-55, May 2003.
[9] E. Felemban, C.-G. Lee, E. Ekici, R. Boder, and S. Vural, “Probabilistic QoS Guarantee in Reliability and Timeliness Domains in Wireless Sensor Networks,” Proc. INFOCOM, Mar. 2005.
[10] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “An Application-Specific Protocol Architecture for Wireless Microsensor Networks,” IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660-670, Oct. 2002.
[11] O. Younis and S. Fahmy, “Distributed Clustering in Ad Hoc Sensor Networks: A Hybrid Energy-Efficient Approach,” Proc. INFOCOM, Mar. 2004.
[12] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “Initializing Newly Deployed Ad Hoc and Sensor Networks,” Proc. MobiCom, Sept. 2004.
[13] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, no. 4, pp. 393-422, Mar. 2002.
[14] G.J. Pottie and W.J. Kaiser, “Wireless Integrated Network Sensors,” Comm. ACM, vol. 43, pp. 51-58, May 2000.
[15] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1979.
[16] B. Sundararaman, U. Buy, and A. Kshemkalyani, “Clock Synchronization for Wireless Sensor Networks: A Survey,” Ad Hoc Networks, vol. 3, no. 3, pp. 281-323, May 2005.
[17] G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Technical Report ISI ISU/RR-87-180, Mar. 1987.
[18] R.W.F. Kuhn and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad Hoc Routing,” Proc. MobiHoc, June 2003.
[19] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 7, no. 6, pp. 609-616, Nov. 2001.
[20] J. Na and C. Kim, “GLR: A Novel Geographic Routing Scheme for Large Wireless Ad Hoc Networks,” Computer Networks, vol. 50, no. 17, pp. 3225-3522, Dec. 2006.
[21] R.P. McAfee and J. McMillan, “Auctions and Bidding,” J. Economic Literature, vol. 25, no. 2, pp. 699-738, June 1987.
[22] B.P. Gerkey and M.J. Mataric, “Sold!: Auction Methods for Multirobot Coordination,” IEEE Trans. Robotics and Automation, vol. 18, no. 5, pp. 758-768, Oct. 2002.
[23] P. Maillé and B. Tuffin, “Multi-Bid Auctions for Bandwidth Allocation in Communication Networks,” Proc. INFOCOM, Mar. 2004.
[24] R. Fourer, D.M. Gay, and B.W. Kernighan, AMPL: A Modeling Language for Math. Programming. Duxbury Press/Brooks/Cole Publishing, 2002.
[25] CPLEX Solver, http:/, 2006.
[26] The J-Sim Simulator, http:/, 2006.

Index Terms:
Wireless Sensor and Actor Networks, Mathematical programming/optimization, Real-Time Communications, Energy Efficiency, Task Allocation
Tommaso Melodia, Dario Pompili, Vehbi C. Gungor, Ian F. Akyildiz, "Communication and Coordination in Wireless Sensor and Actor Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 10, pp. 1116-1129, Oct. 2007, doi:10.1109/TMC.2007.1009
Usage of this product signifies your acceptance of the Terms of Use.