[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Design and performance of wireless data gathering networks based on unicast random walk routing

Published: 01 August 2009 Publication History

Abstract

Wireless environment monitoring applications with significantly relaxed quality-of-service constraints are emerging. Hence, the possibility to use rough low knowledge routing in sensor networks to reduce hardware resource and software complexity is questionable. Moreover, low knowledge handling allows better genericity, which is of interest, for instance, for basic operation enabling system set-up. In this framework, this paper revisits stateless unicast random walk routing in wireless sensor networks. Based on random walk theory, original closed-form expressions of the delay, the power consumption and related spatial behaviors are provided according to the scale of the system. Basic properties of such a random routing are discussed. Exploiting its properties, data gathering schemes that fulfill the requirements of the application with rather good energy efficiency are then identified.

References

[1]
K. Holger and A. Willing, Protocols and Architectures for Wireless Sensor Networks. New York: Wiley, 2005.
[2]
M. Hempstead, N. Tripathi, P. Mauro, G.-Y. Wei, and D. Brooks, "An ultra low power system architecture for sensor network applications," in Proc. 32nd Int. Symp. Comput. Arch., Jun. 2005, pp. 208-219.
[3]
P. Juang, H. Oki, Y. Wang, M. Martonozi, L.-S. Peh, and D. Rubenstein, "Energy-efficient computing for wildlife tracking: Design trade-offs and early experiences with zebranet," in Proc. 10th Int. Conf. Arch. Support Program. Lang. Oper. Syst., Oct. 2002, pp. 96-107.
[4]
R. Cardell-Oliver, K. Smettem, M. Kranz, and K. Mayer, "A reactive soil moisture sensor network: Design and field evaluation," Int. J. Distributed Sensor Networks, vol. 1, no. 2, pp. 149-162, Jun. 2005.
[5]
P. Sikka, P. Corke, P. Valencia, C. Crossman, D. Swain, and G. Bishop-Hurley, "Wireless ad hoc sensor and actuator networks on the farm," in Proc. 5th Int. Conf. Inf. Process. Sensor Netw., Apr. 2006, pp. 492-499.
[6]
"Efficient and lightweight wireless sensor communication systems - Novel cross optimization," in e-SENSE IST-4-027227-Integrated Project, Capturing Ambient Intelligence for Mobile Communications through Wireless Sensor Networks, Dec. 2007.
[7]
P. Chen, B. O'Dea, and E. Callaway, "Energy efficient system design with optimum transmission range for wireless ad hoc networks," in Proc. IEEE Int. Conf. Communications, Apr. 2002, vol. 1, pp. 945-952.
[8]
S. Ergen and P. Varaiya, "On multi-hop routing for energy efficiency," IEEE Commun. Lett., vol. 9, no. 10, pp. 880-881, Oct. 2005.
[9]
G. Xing, C. Lu, Y. Zhang, and Q. Huang, "Minimum power configuration in wireless sensor networks," in Proc. 6th ACM Int. Symp. Mobile Ad Hoc Networking and Computing, May 2005, pp. 390-401.
[10]
R. Shah and J. M. Rabaey, "Energy aware routing for low energy ad hoc sensor networks," in Proc. IEEE Wireless Communications and Networking Conf., Mar. 2002, pp. 812-817, 1.
[11]
J.-H. Chang and L. Tassiulas, "Maximum lifetime routing in wireless sensor networks," IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 609-619, Apr. 2004.
[12]
Y. T. Hou, Y. Shi, and H. D. Sherali, "On lexicographic max-min node lifetime for wireless sensor networks," in Proc. IEEE Int. Conf. Communications , Jun. 2004, pp. 3790-3796.
[13]
S. D. Servetto and G. Barrenechea, "Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks," in Proc. 1st ACM Int. Workshop Wireless Sensor Netw. Applicat. , New York, NY, 2002, pp. 12-21.
[14]
A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," Duke University, Tech. Rep. CS-200006, 2000.
[15]
Z. Haas, J. Halpern, and L. Li, "Gossip-based ad hoc routing," in Proc. 21st Annu. Conf. Comput. Commun., Jun. 2002, pp. 1707-1716.
[16]
O. Dousse, "Asymptotic properties of wireless multi-hop network," Ph.D. dissertation, École Polytechnique Fédérale de Lausanne, Switzerland, 2005.
[17]
D. Braginsky and D. Estrin, "Rumor routing algorthim for sensor networks," in Proc. 1st ACM Int. Workshop Wireless Sensor Netw. Applicat. , New York, NY, 2002, pp. 22-31.
[18]
M. Zhong and K. Shen, "Random walk based node sampling in self-organizing networks," Oper. Syst. Rev., vol. 40, no. 3, pp. 49-55, 2006.
[19]
J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," Cornell, Ithaca, NY, Tech. Rep., 1999.
[20]
B. D. Hugues, Random Walks and Random Environments. Oxford, U.K.: Oxford Science, 1995, vol. 1.
[21]
R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation of Computer Science, 2nd ed. Reading, MA: Addison-Wesley, 1994.
[22]
E. Duarte-Melo and L. Mingyan, "Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks," in Proc. Global Telecommunication Conf., Nov. 2002, vol. 1, pp. 21-25.
[23]
L. Lima and J. Barros, "Random walks on sensor networks," in Proc. 5th Int. Symp. Modelling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Apr. 2007.

Cited By

View all
  • (2013)Analytical revisit on the use of biased random walks for data forwarding in wireless sensor networksProceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems10.1145/2507924.2507994(267-272)Online publication date: 3-Nov-2013
  • (2013)Load balancing techniques for lifetime maximizing in wireless sensor networksAd Hoc Networks10.1016/j.adhoc.2013.04.00911:8(2172-2186)Online publication date: 1-Nov-2013
  • (2011)Analysis of latency of stateless opportunistic forwarding in intermittently connected networksIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2010.210332119:4(1111-1124)Online publication date: 1-Aug-2011
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 17, Issue 4
August 2009
337 pages

Publisher

IEEE Press

Publication History

Published: 01 August 2009
Revised: 10 June 2008
Received: 29 June 2007
Published in TON Volume 17, Issue 4

Author Tags

  1. data gathering
  2. quality of service (QoS)
  3. random walk
  4. routing
  5. wireless sensor networks

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 11 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2013)Analytical revisit on the use of biased random walks for data forwarding in wireless sensor networksProceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems10.1145/2507924.2507994(267-272)Online publication date: 3-Nov-2013
  • (2013)Load balancing techniques for lifetime maximizing in wireless sensor networksAd Hoc Networks10.1016/j.adhoc.2013.04.00911:8(2172-2186)Online publication date: 1-Nov-2013
  • (2011)Analysis of latency of stateless opportunistic forwarding in intermittently connected networksIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2010.210332119:4(1111-1124)Online publication date: 1-Aug-2011
  • (2009)From Rosenstock model to random walk based routing in wireless sensor networksProceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools10.4108/ICST.VALUETOOLS2009.7814(1-10)Online publication date: 20-Oct-2009

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media