ACM Home Page
Please provide us with feedback. Feedback
Limiting the impact of mobility on ad hoc clustering
Full text PdfPdf (187 KB)
Source International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks table of contents
Montreal, Quebec, Canada
SESSION: Technical papers table of contents
Pages: 197 - 204  
Year of Publication: 2005
ISBN:1-59593-182-1
Authors
Rituparna Ghosh  Northeastern University, Boston, MA
Stefano Basagni  Northeastern University, Boston, MA
Sponsors
ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1089803.1089986
What is a DOI?

ABSTRACT

This paper explores the impact of node mobility on DMAC, a typical clustering protocol for mobile ad hoc networks. Several protocols for clustering have been proposed, which are quite similar in operations and performance. We selected one and evaluate the cost of maintaining the clustering structures when the nodes move according to three different mobility models, namely, the random way point model, the Brownian motion and the Manhattan mobility model. Via ns2-based simulations we have observed that the mobility models have different impact on protocol performance. The general trend, however, appears to be the same for networks of increasing size. The second contribution of this paper concerns mitigating the impact of mobility over the clustering structure and hence on the overall network performance. We consider a generalization of DMAC (GDMAC) where rules are established to decrease the number of cluster updates. Via simulation we have observed that GDMAC is effective in reducing the clustering overhead imposed by mobility, and hence its maintenance cost.


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
 
2
Amis, A. D., Prakash, R., Vuong, T. H. P., and Huynh, D. T. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE Infocom 2000 (Tel Aviv, Israel, March 26--30 2000), vol. 1, pp. 32--41.
 
3
 
4
Baker, D. J., and Ephremides, A. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications COM-29, 11 (November 1981), 1694--1701.
 
5
Banerjee, S., and Khuller, S. A clustering scheme for hierarchical control in multi-hop wireless networks. In Proceedings of the 20th IEEE Infocom 2001 (Anchorage, AK, April 22--26 2001), vol. 2, pp. 1028--1037.
 
6
Basagni, S. Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In Proceedings of the IEEE 50th International Vehicular Technology Conference, VTC 1999-Fall (Amsterdam, The Netherlands, September 19--22 1999), vol. 2, pp. 889--893.
 
7
 
8
Basagni, S., Mastrogiovanni, M., Panconesi, A., and Petrioli, C. Localized protocols for ad hoc clustering and backbone formation: A performance comparison. IEEE Transactions on Parallel and Distributed Systems, Special Issue on Localized Communication and Topology Protocols for Ad Hoc Networks (S. Olariu, D. Simplot-Ryl, and I. Stojmenovic, editors) (2006). To appear.
 
9
Basu, P., Khan, N., and Little, T. A mobility based metric for clustering in mobile ad hoc networks, 2001.
 
10
Belding-Royer, E. M. Hierarchical routing in ad hoc mobile networks. Wireless Communication & Mobile Computing 2, 5 (2002), 515--532.
 
11
Bettstetter, C., and Friedrich, B. Time and message complexity of the generalized distributed mobility adaptive clustering (GDMAC) algorithm in wireless multihop networks. In Proceeding of the 57th IEEE Semiannual Vehicular Technology Conference, VTC 2003-Spring (Jeju, Korea, April 22--25 2003), vol. 1, pp. 176--180.
 
12
Camp, T., Boleng, J., and Davies, V. A survey of mobility models for ad hoc network research. Wiley Interscience's Wireless Communications & Mobile Computing, Special Issue on Mobile Ad Hoc Networking: Research Trend and Application, S. Basagni and S.J. Lee, eds. 2, 5 (August 2002), 483--502.
 
13
 
14
 
15
Er, I. I., and Seah, W. K. G. Mobility-based d-hop clustering algorithm for mobile ad hoc networks. In Proceedings of IEEE Wireless Communications and Networking Conference (Atlanta, Georgia, USA, March 21-25 2004).
16
 
17
18
 
19
Lin, C. R., and Gerla, M. Adaptive clustering for mobile wireless networks. Journal on Selected Areas in Communications 15, 7 (September 1997), 1265--1275.
 
20
Selection procedures for the choice of radio transmission technologies of the (UMTS) (ts30.03 v3.2.0). (TS 30.03 3GPP), April 1998.
 
21
McDonald, A. B., and Znati, T. A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad Hoc Networks 17, 8 (August 1999), 1466--1487.
 
22
Parekh, A. K. Selecting routers in ad hoc wireless networks. In Proceedings of the SBT/IEEE International Telecommunications Symposium, ITS 1994 (Rio de Janeiro, Brazil, August 1994).
 
23
 
24
The VINT Project. The ns Manual. http://www.isi.edu/nsnam/ns/, 2002.
 
25

Collaborative Colleagues:
Rituparna Ghosh: colleagues
Stefano Basagni: colleagues