The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2010 vol.21)
pp: 1692-1705
Hosam Rowaihy , King Fahd University of Petroleum and Minerals (KFUPM), Dhahran
Diego Pizzocaro , Cardiff University, Cardiff
Amotz Bar-Noy , City University of New York, New York
Stuart Chalmers , University of Aberdeen, Aberdeen
Thomas F. La Porta , The Pennsylvania State Univeristy, University Park
Alun Preece , Cardiff University, Cardiff
ABSTRACT
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In the most general setting, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In what we call the dynamic setting, missions arrive over time and have different durations. For this setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help, making this decision based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.
INDEX TERMS
Wireless sensor networks, resource allocation, mission assignment.
CITATION
Hosam Rowaihy, Diego Pizzocaro, Amotz Bar-Noy, Stuart Chalmers, Thomas F. La Porta, Alun Preece, "Sensor-Mission Assignment in Constrained Environments", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 11, pp. 1692-1705, November 2010, doi:10.1109/TPDS.2010.36
REFERENCES
[1] J. Abrache, T.G. Crainic, M. Gendreau, and M. Rekik, "Combinatorial Auctions," Annals of Operations Research, vol. 153, no. 1, pp. 131-164, 2007.
[2] R. Ahuja, T. Magnanti, and J. Orlin, Network Flows. Prentice Hall, 1993.
[3] A. Bar-Noy, T. Brown, M.P. Johnson, T. La Porta, O. Liu, and H. Rowaihy, "Assigning Sensors to Missions with Demands," Proc. Third Int'l Workshop Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), 2007.
[4] C. Bisdikian, "On Sensor Sampling and Quality of Information: A Starting Point," Proc. Fifth Ann. IEEE Int'l Conf. Pervasive Computing and Comm. Workshops (PerCom '07 Workshops), Mar. 2007.
[5] J. Byers and G. Nasser, "Utility-Based Decision-Making in Wireless Sensor Networks," Proc. ACM MOBIHOC, 2000.
[6] R. Cohen, L. Katzir, and D. Raz, "An Efficient Approximation for the Generalized Assignment Problem," Information Processing Letters, vol. 100, no. 4, pp. 162-166, 2006.
[7] S. de Vries and R. Vohra, "Combinatorial Auctions: A Survey," INFORMS J. Computing, vol. 15, no. 3, pp. 284-309, 2003.
[8] L. Fleischer, M.X. Goemans, V.S. Mirrokni, and M. Sviridenko, "Tight Approximation Algorithms for Maximum General Assignment Problems," Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '06), pp. 611-620, 2006.
[9] Y. Fujishima, K. Leyton-Brown, and Y. Shoham, "Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches," Proc. 16th Int'l Joint Conf. Artificial Intelligence, pp. 548-553, 1999.
[10] L. Kaplan, "Global Node Selection for Localization in a Distributed Sensor Network," IEEE Trans. Aerospace and Electronic Systems, vol. 42, no. 1, pp. 113-135, Jan. 2006.
[11] B. Karp and H. Kung, "Greedy Perimeter Stateless Routing for Wireless Networks," Proc. ACM MobiCom '00, pp. 243-254, Aug. 2000.
[12] lpsolve. http://sourceforge.net/projectslpsolve, 2010.
[13] J. Lu, L. Bao, and T. Suda, "Coverage-Aware Sensor Engagement in Dense Sensor Networks," Proc. Int'l Conf. Embedded and Ubiquitous Computing (EUC '05), Dec. 2005.
[14] T. Mullen, V. Avasarala, and D.L. Hall, "Customer-Driven Sensor Management," IEEE Intelligent Systems, vol. 21, no. 2, pp. 41-49, Mar./Apr. 2006.
[15] N. Nisan, "Bidding and Allocation in Combinatorial Auctions," Proc. Second ACM Conf. Electronic Commerce, pp. 1-12, 2000.
[16] M. Perillo and W. Heinzelman, "Optimal Sensor Management under Energy and Reliability Constraints," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2010.
[17] M.H. Rothkopf, A. Peke, and R.M. Harstad, "Computationally Manageable Combinational Auctions," Management Science, vol. 44, no. 8, pp. 1131-1147, Aug. 1998.
[18] H. Rowaihy, S. Eswaran, M.P. Johnson, D. Verma, A. Bar-Noy, T. Brown, and T. La Porta, "A Survey of Sensor Selection Schemes in Wireless Sensor Networks," Proc. SPIE Defense and Security Symp., 2007.
[19] H. Rowaihy, M.P. Johnson, A. Bar-Noy, T. Brown, and T. La Porta, "Assigning Sensors to Competing Missions," Proc. IEEE Global Comm. Conf. (GLOBECOM), 2008.
[20] H. Rowaihy, M.P. Johnson, T. Brown, A. Bar-Noy, and T. La Porta, "Assigning Sensors to Competing Missions," Technical Report NAS-TR-0080-2007, Network and Security Research Center, Dept. of Computer Science and Eng., Pennsylvania State Univ., Univ. Park, PA, Oct. 2007.
[21] K. Shih, Y. Chen, C. Chiang, and B. Liu, "A Distributed Active Sensor Selection Scheme for Wireless Sensor Networks," Proc. IEEE Symp. Computers and Comm., June 2006.
[22] S.C. Sung and M. Vlach, "Maximizing Weighted Number of Just-in-Time Jobs on Unrelated Parallel Machines," J. Scheduling, vol. 8, no. 5, pp. 453-460, 2005.
[23] V.V. Vazirani, Approximation Algorithms. Springer, 2001.
[24] F. Zhao, J. Shin, and J. Reich, "Information-Driven Dynamic Sensor Collaboration," IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 61-72, Mar. 2002.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool