MINE and MILE
- 1 October 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOBILE Mobile Computing and Communications Review
- Vol. 8 (4), 19-36
- https://doi.org/10.1145/1052871.1052873
Abstract
Ad-Hoc networks are useful where infrastructure networks cannot be deployed or are not cost effective, like temporary deployment in a conference or in case of emergency. However, the nature of ad-hoc networks and especially the mobility of nodes make it difficult to achieve a certain minimum connectivity, which is an indispensable property for many applications. The question we are interested in is: How can connectivity in ad-hoc networks be improved? In this paper, we suggest to introduce dedicated mobile nodes whose only purpose is to maintain the network. These " M obile I nfrastructure N od E s" (MINEs) move to positions where they are useful to (re-)create links between normal nodes. We introduce into the MINE concept and then present and analyze several information exploitation and movement strategies these infrastructure nodes could follow in order to efficiently complete their job. These strategies are based on a location exchange protocol which we call M obile I nfrastructure L ocation E xchange (MILE). Simulations compare the different strategies and show the usefulness of the approach, and they argue for the efficiency of the MILE protocol.Keywords
This publication has 26 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless NetworksPublished by Springer Nature ,2007
- The Number of Neighbors Needed for Connectivity of Wireless NetworksWireless Networks, 2004
- Capacity regions for wireless ad hoc networksIEEE Transactions on Wireless Communications, 2003
- The critical transmitting range for connectivity in sparse wireless ad hoc networksIEEE Transactions on Mobile Computing, 2003
- Metropolitan area mobile services to support virtual groupsIEEE Transactions on Mobile Computing, 2002
- An efficient algorithm for the uncapacitated facility location problem with totally balanced matrixDiscrete Applied Mathematics, 2001
- Embedding robots into the InternetCommunications of the ACM, 2000
- Ad hoc mobility management with uniform quorum systemsIEEE/ACM Transactions on Networking, 1999
- On the connectivity of radio networksIEEE Transactions on Information Theory, 1991
- Connectivity properties of a packet radio network modelIEEE Transactions on Information Theory, 1989