Towards distributed network classification for mobile ad hoc networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Towards distributed network classification for mobile ad hoc networks

Full text

Pdf (317 KB)

Source

ACM International Conference Proceeding Series archive
Proceedings of the 4th Annual International Conference on Wireless Internet table of contents

Maui, Hawaii

SESSION: Traffic engineering in wireless networks table of contents

Article No. 57

Year of Publication: 2008

ISBN:978-963-9799-36-3

Authors

Dimitrios Antonellis	University of Southern California
Ahmed Mansy	Georgia Institute of Technology
Konstantinos Psounis	University of Southern California
Mostafa H. Ammar	Georgia Institute of Technology

Sponsors

: ICST
: Intel
: XIRRUS

Publisher

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

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 28, 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

Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communication is achieved by the store, carry, and forward model of routing. Hence, nodes of these networks need to identify the level of connectivity of the network they belong to and classify it as a MANET or a DTN, in order to properly select appropriate protocols to achieve end-to-end communication. What is more, since mobile ad hoc networks change over time and space, nodes need to periodically re-access their network classification to adapt to the always changing environment.

Recently, there has been an effort to classify the various types of mobile ad hoc networks assuming there is a centralized authority that has complete knowledge of the network and its dynamics. In this paper we design distributed mechanisms for nodes to perform the above classification on the fly, based only on local information that they collect as they move and encounter other nodes. The mechanisms take advantage of a combination of measurements and analytical techniques. We investigate the accuracy of our mechanisms by comparing the network classification of the centralized authority to that of a node using our schemes.

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	E. M. Belding-Royer, C. E. Perkins, and S. R. Das. Ad-hoc on-demand distance vector routing. IETF MANET DRAFT, 2002.
	2	Christian Bettstetter, Mobility modeling in wireless networks: categorization, smooth movement, and border effects, ACM SIGMOBILE Mobile Computing and Communications Review, v.5 n.3, p.55-66, July 2001 [doi>10.1145/584051.584056]
	3	Christian Bettstetter, On the minimum node degree and connectivity of a wireless multihop network, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513811]
	4	Vincent Borrel , Mostafa H. Ammar , Ellen W. Zegura, Understanding the wireless and mobile network space: a routing-centered classification, Proceedings of the second ACM workshop on Challenged networks, September 14-14, 2007, Montreal, Quebec, Canada [doi>10.1145/1287791.1287795]
	5	O. Dousse and P. Thiran. Connectivity vs capacity in dense ad hoc networks. In Proc. IEEE Infocom, Hong Kong, 2004.
	6	David B. Johnson , David A. Maltz , Josh Broch, DSR: the dynamic source routing protocol for multihop wireless ad hoc networks, Ad hoc networking, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2001
	7	Qun Li , Daniela Rus, Communication in disconnected ad hoc networks using message relay, Journal of Parallel and Distributed Computing, v.63 n.1, p.75-86, January 2003 [doi>10.1016/S0743-7315(02)00033-3]
	8	Ram Ramanathan , Prithwish Basu , Rajesh Krishnan, Towards a formalism for routing in challenged networks, Proceedings of the second ACM workshop on Challenged networks, September 14-14, 2007, Montreal, Quebec, Canada [doi>10.1145/1287791.1287794]
	9	Thrasyvoulos Spyropoulos , Apoorva Jindal , Konstantinos Psounis, An analytical study of fundamental mobility properties for encounter-based protocols, International Journal of Autonomous and Adaptive Communications Systems, v.1 n.1, p.4-40, July 2008 [doi>10.1504/IJAACS.2008.019198]
	10	Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.252-259, August 26-26, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080139.1080143]
	11	Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Efficient routing in intermittently connected mobile networks: the single-copy case, IEEE/ACM Transactions on Networking (TON), v.16 n.1, p.63-76, February 2008 [doi>10.1109/TNET.2007.897962]
	12	Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Performance analysis of mobility-assisted routing, Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing, May 22-25, 2006, Florence, Italy [doi>10.1145/1132905.1132912]
	13	A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical report, Duke University, CS-200006, 2000.
	14	W. Zhao , M. Ammar , E. Zegura, A message ferrying approach for data delivery in sparse mobile ad hoc networks, Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, May 24-26, 2004, Roppongi Hills, Tokyo, Japan [doi>10.1145/989459.989483]