Multi-resolution state retrieval in sensor networks

Large-scale dense sensor networks require mechanisms to extract topology information that can be used for various aspects of sensor network management. It is critical for any topology discovery algorithm in dense networks not only to adhere to the resource constraints of bandwidth and energy but also to provide several views of the network. Due to factors of density, redundancy and failures it may not be possible or practical to get a complete view of the topology. We describe a distributed parameterized algorithm for Sensor Topology Retrieval at Multiple Resolutions (STREAM), which makes a tradeoff between topology details and resources expended. The algorithm retrieves network state at multiple resolutions at a proportionate communication cost. We also define various classes of topology queries and show how the parameters in the algorithm can be used to support queries specific to sensor networks. We show that topology determined at different resolutions is sufficient for approximating different network properties. We also show that STREAM can be used for general-purpose multi-resolution information retrieval in sensor networks.

[1]  R.R. Chpudhury,et al.  A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[2]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[3]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[5]  Romit Roy Choudhury,et al.  A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents , 2000, MobiHoc.

[6]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[7]  Liviu Iftode,et al.  Cooperative computing for distributed embedded systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[8]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[9]  Baruch Awerbuch,et al.  Topology aggregation for directed graphs , 2001, TNET.

[10]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[11]  B. R. Badrinath,et al.  STREAM: Sensor Topology Retrieval at Multiple Resolutions , 2004, Telecommun. Syst..

[12]  Deborah Estrin,et al.  Residual Energy Scans for Monitoring Wireless Sensor Networks , 2002 .

[13]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[14]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[15]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[16]  Liviu Iftode,et al.  Cooperative Computin for Distributed Embedded Systems , 2002, ICDCS 2002.

[17]  S. Khuller,et al.  A Clustering Scheme for Hierarchical Control in Wireless Networks , 2001 .

[18]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Peter Steenkiste,et al.  Collecting network status information for network-aware applications , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[21]  Rajeev Rastogi,et al.  Topology discovery in heterogeneous IP networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[24]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[25]  Samir Khuller,et al.  A clustering scheme for hierarchical control in multi-hop wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Deborah Estrin,et al.  Residual energy scan for monitoring sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[27]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  Azer Bestavros,et al.  Inference and labeling of metric-induced network topologies , 2005, IEEE Transactions on Parallel and Distributed Systems.

[29]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[30]  Thomas R. Gross,et al.  Topology discovery for large ethernet networks , 2001, SIGCOMM '01.

[31]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).