Seapahn Meguerdichian
ABSTRACT
The development of practical, localization algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a special type of distributed algorithms where only a subset of nodes in the WASN participate in sensing, communication, and computation. We have developed a generic localized algorithm for solving optimization problems in wireless ad-hoc networks that has five components: (i) data acquisition mechanism, (ii) optimization mechanism, (iii) search expansion rules, (iv) bounding conditions and (v) termination rules. the main idea is to request and process data only locally and only from nodes who are likely to contribute to rapid formation of the final solution. The approach enables two types of optimization: The first, guarantees the fraction of nodes that are contacted while optimizing for solution quality. The second, provides guarantees on solution qualities while minimizing the number of nodes that are contacted and/or amount of communication. The localized optimization approach is applied to two fundamental problems in sensor networks: location discovery and exposure-based coverage. We demonstrate its effective-ness on a number of examples
- Abe00.H. Abelson, et. al. "Amorphous Computing." Communications of the ACM, Volume 43, No. 5, pp. 74-82, May 2000. Google Scholar
Digital Library
- Abi00.A.A. Abidi, G.J. Pottie, W.J. Kaiser, "Power-Conscious Design Of Wireless Circuits And Systems.' Proceedings of the IEEE, vol.88, (no.10), pp. 1528-45, Oct. 2000.Google ScholarCross Ref
- Adj99.W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, J. Lilley, "The Design And Implementation Of An Intentional Naming System." Operating Systems Review, vol.33, (no.5), pp.186-201, Dec. 1999. Google ScholarDigital Library
- Bad93.B.R. Badrinath, et. al. "Impact Of Mobility On Distributed Computations." ACM Operating Systems Review, April 1993. Google ScholarDigital Library
- Aur91.F. Aurenhammer, "Voronoi Diagrams - A Survey Of A Fundamental Geometric Data Structure," ACM Computing Surveys 23, pp. 345-405, 1991. Google ScholarDigital Library
- Ben93.M. Bender et. al. "Unix For Nomads: Making Unix Support Mobile Computing." In Proceedings of the USENIX Symposium on Mobile & Location Independent Computing, August 1993.Google Scholar
- Beu99.J. Beutel, "Geolocation In A PicoRadio Environment." M.S. Thesis, ETH Z~rich, Electronics Lab, 1999.Google Scholar
- Bul00.N. Bulusu, J. Heidemann, D. Estrin, ""GPS-less Low Cost Outdoor Localization For Very Small Devices." IEEE Personal Communications, Special Issue on "Smart Spaces and Environments", Vol. 7, No. 5, pp. 28-34, October 2000.Google Scholar
- Cor90.T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Pres, June 1990. Google ScholarDigital Library
- Dow98.T.B. Downing. Java RMI: Remote Method Invocation. IDG Books Worldwide, New York, 1998. Google ScholarDigital Library
- Dur89.E.H. Durfee, V.R. Lesser and D.D. Corkill, "Trends in Cooperative Distributed Problem Solving." IEEE Transactions on Knowledge and Data Engineering, Vol.1, pp. 63-83, March 1989. Google ScholarDigital Library
- Est00.D. Estrin, R. Govindan, J. Heidemann. "Embedding the Internet: Introduction." Com. of the ACM, Vol. 43, pp. 38-42, May. 2000. Google ScholarDigital Library
- Has97.Z.J. Haas, "On The Relaying Capability Of The Reconfigurable Wireless Networks." IEEE 47th Vehicular Technology Conference, Vol.2, pp. 1148-52, May 1997.Google Scholar
- Int00.C. Intanangonwiwat, D. Estrin, R. Govindan, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks." Procs. of ACM MobiCOM 2000, August 2000. Google ScholarDigital Library
- Gal83.R.G. Gallager, P.A. Humblet, P.M. Spira, "A Distributed Algorithm For Minimum Spanning Tree." ACM Transactions on Programming Languages and Systems, pp. 66-77, 1983. Google ScholarDigital Library
- Gir01.L. Girod, D. Estrin, "Robust Range Estimation Using Acoustic And Multimodal Sensing." IEEE/RSI Int. Conf. on Intelligent Robots and Systems (IROS 2001), Maui, Hawaii, October 2001 (To Appear).Google Scholar
- Hoa85.C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985. Google ScholarDigital Library
- Kan00.C.W. Kang, M.W. Golay, "An Integrated Method For Comprehensive Sensor Network Developement In Complex Power Plant Systems." Reliability Engineering & System Safety, vol.67, pp. 17-27, Jan. 2000.Google ScholarCross Ref
- Kis92.J. Kistler, M. Satyanarayanan. "Disconnected Operation In The Coda File System." ACM Trans. on Computer Systems, Feb. 1992. Google ScholarDigital Library
- Lam78.L. Lamport, "Times, Clocks, And The Ordering Of Events In A Distributed System." CACM, pp. 558-565, July 1978. Google ScholarDigital Library
- Lam90.L. Lamport, N. Lynch, "Distributed Computing: Models And Methods." Handbook of Theoretical Computer Science, pp. 1158-1199, Elsevier Science Publishers, 1990. Google ScholarDigital Library
- Lie98.K. Lieska, E. Laitinen, J. Lahteenmaki, "Radio Coverage Optimization With Genetic Algorithms." IEEE Int. Symp. on Personal, Indoor and Mobile Radio Communications, pp. 318-22, Sept. 1998.Google Scholar
- Lyn96.N. Lynch. Distributed Algorithms. Morgan Kaufman, San Francisco, 1996. Google ScholarDigital Library
- Meg01a.S. Meguerdichian, F. Koushanfar, M. Potkonjak, M. Srivastava, "Coverage Problems in Wireless Ad-Hoc Sensor Networks." IEEE Infocom 2001, Vol. 3, pp. 1380-1387, April 2001.Google Scholar
- Meg01b.S. Meguerdichian, F. Koushanfar, G. Qu, M. Potkonjak, "Exposure In Wireless Ad Hoc Sensor Networks.' Procs. of Int. Conf. on Mobile Computing and Networking (MobiCom '01), July 2001. Google ScholarDigital Library
- Mil89.R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989. Google ScholarDigital Library
- MIT82.MIT Lincoln Laboratories. Workshop on Distributed Sensor Networks. 1982.Google Scholar
- Glo2.Glomosim 2.0. http://pcl.cs.ucla.edu/projects/glomosim/Google Scholar
- ORo92.J. O'Rourke, Computational geometry column 15. (Open problem from art gallery solved). Int. Journal of Computational Geometry & Applications, vol.2, pp.215-17, June 1992.Google Scholar
- Pot00.G. J. Pottie, W. Kaiser, "Wireless Integrated Network Sensors." Communications of the ACM, Vol. 43, No. 5, pp. 51-58, May 2000. Google ScholarDigital Library
- Ray88.M. Raynal, Distributed Algorithms and Protocols, John Wiley and Sons, 1988. Google ScholarDigital Library
- Rum86.D. E. Rumelhart, J. L. McClelland, Parallel Distributed Processing: Explorations in the Microstructure of Cognition. MIT Press, 1986. Google ScholarDigital Library
- Sav01a.C. Savarese, J. Rabaey, J. Beutel, "Locationing in Distributed Ad-Hoc Wireless Sensor Networks." Proceedings of the ICASSP, May 2001.Google Scholar
- Sav01b.A. Savvides, C.C. Han, M.B. Srivastava, "Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors." Procs. of MobiCom 2001, July 2001. Google ScholarDigital Library
- Tel94.G. Tel, Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, U.K., 1994. Google ScholarDigital Library
- Ten00.D. Tennenhouse, "Proactive computing." Communications of the ACM, vol. 43, No. 5, pp. 43-50, May 2000. Google ScholarDigital Library
Index Terms
- Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
Recommendations
Localized algorithms for coverage boundary detection in wireless sensor networks
Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the ...
Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks
Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must ...
Power-efficient communication algorithms for wireless mobile sensor networks
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networksOne important issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is a scarce resource in a sensor node. Many protocols have been proposed for data-gathering between wireless sensor nodes. ...
Comments