Power-efficient gossiping in multi-hop ad hoc networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Power-efficient gossiping in multi-hop ad hoc networks

Full text

Pdf (726 KB)

Source

International Conference on Autonomic Computing and Communication Systems archive
Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems table of contents

Turin, Italy

Article No. 28

Year of Publication: 2008

ISBN:978-963-9799-34-9

Authors

Benoît Garbinato	University of Lausanne
Denis Rochat	University of Lausanne
Marco Tomassini	University of Lausanne

Sponsors

: ICST
ACM: Association for Computing Machinery
: Create-Net

Publisher

ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) ICST, Brussels, Belgium, Belgium

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 26, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

ABSTRACT

In this paper, we present a novel gossiping protocol for disseminating information in static and mobile multi-hop ad hoc networks. Our protocol exhibits two interesting properties. First, it tends to decrease the power required to disseminate information, by reducing the transmission range each network node uses for gossiping. This property results in a longer life expectancy for the ad hoc network, when running on power-constrained devices. Second, mobility has no negative impact on the performance of our protocol, meaning that it is equally useful in a static context and in a mobile context. Both these properties are shown empirically, via a thorough performance evaluation. It is also noteworthy that our protocol retains the decentralized and stateless nature of traditional gossiping protocols.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, 2002.
	2	B. Garbinato, D. Rochat, and M. Tomassini. Impact of scale-free topologies on gossiping in ad hoc networks. In NCA, pages 269--272. IEEE Computer Society, 2007.
	3	Mario Giacobini , Marco Tomassini , Andrea Tettamanzi, Takeover time curves in random and small-world structured populations, Proceedings of the 2005 conference on Genetic and evolutionary computation, June 25-29, 2005, Washington DC, USA [doi>10.1145/1068009.1068224]
	4	A. Iamnitchi, M. R., and I. Foster. Small-world file-sharing communities. In The 23rd Conference of the IEEE Communications Society (InfoCom 2004), Hong Kong, 2004.
	5	Márk Jelasity , Alberto Montresor , Ozalp Babaoglu, Gossip-based aggregation in large dynamic networks, ACM Transactions on Computer Systems (TOCS), v.23 n.3, p.219-252, August 2005 [doi>10.1145/1082469.1082470]
	6	David B Johnson and David A Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
	7	M. Khambatti, K. D. Ryu, and P. Dasgupta. Push-pull gossiping for information sharing in peer-to-peer communities. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA03), pages 1393--1399. CSREA Press, June 2003.
	8	Jean-Yves Le Boudec , Milan Vojnovic, The random trip model: stability, stationary regime, and perfect simulation, IEEE/ACM Transactions on Networking (TON), v.14 n.6, p.1153-1166, December 2006 [doi>10.1109/TNET.2006.886311]
	9	M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167--256, 2003.
	10	Distributed Computing Group of ETH Zurich. Sinalgo: a simulation framework for manets. http://dcg.ethz.ch/projects/sinalgo/.
	11	Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
	12	Ram Ramanathan and Regina Hain. Topology control of multihop wireless networks using transmit power adjustment. In INFOCOM (2), pages 404--413, 2000.
	13	C.-K. Toh. Maximum battery life routing to support ubiquitous mobile computing in wireless ad-hoc networks. 39(6):138--147, 2001.
	14	S. Voulgaris, M. Jelasity, and M. van Steen. A robust and scalable peer-to-peer gossiping protocol. In Agents and Peer-to-Peer Computing, volume 2872 of Lecture Notes in Computer Science, pages 47--58. Springer, 2004.
	15	Kun Wang , Yin-long Xu , Guo-liang Chen , Ya-feng Wu, Power-Aware On-Demand Routing Protocol for MANET, Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04), p.723-728, March 23-24, 2004
	16	Roger Wattenhofer, Li Li, Paramvir Bahl, and Yi-Min Wang. Distributed topology control for wireless multihop ad-hoc networks. In INFOCOM, pages 1388--1397, 2001.
	17	Q. Zheng, W. Peng, Y. Wang, and X. Lu. An efficient broadcast algorithm based on connected dominating set in unstructured peer-to-peer network. In Web Information Systems - Proceedings of the 5th International Conference on Web Information Systems Engineering (WISE 2004), volume 3306, pages 724--729. Lecture Notes in Computer Science, November 2004.