ACM Home Page
Please provide us with feedback. Feedback
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Full text PdfPdf (344 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing table of contents
Annapolis, Maryland, USA
SESSION: Topology & MAC table of contents
Pages: 141 - 152  
Year of Publication: 2003
ISBN:1-58113-684-6
Authors
Douglas M. Blough  Georgia Inst. of Technology, Atlanta GA
Mauro Leoncini  Università di Modena e, Reggio Emilia, Italy
Giovanni Resta  IIT, CNR, Pisa, Italy
Paolo Santi  IIT, CNR, Pisa, Italy
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 72,   Citation Count: 29
Additional Information:

abstract   references   cited by   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/778415.778433
What is a DOI?

ABSTRACT

We propose an approach to topology control based on the principle of maintaining the number of neighbors of every node equal to or slightly below a specific value k. The approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols. To evaluate the performance of our approach, we estimate the value of k that guarantees connectivity of the communication graph with high probability. We then define k-Neigh, a fully distributed, asynchronous, and localized protocol that follows the above approach and uses distance estimation. We prove that k-Neigh terminates at every node after a total of 2n messages have been exchanged (with n nodes in the network) and within strictly bounded time. Finally, we present simulations results which show that our approach is about 20% more energy-efficient than a widely-studied existing protocol.


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
M. Bahramgiri, M. Hajiaghayi, V.S. Mirrokni, "Fault-tolerant ad 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks", Proc. IEEE Int. Conference on Computer Communications and Networks, pp. 392--397, 2002.
2
 
3
 
4
D.M. Blough, M. Leoncini, G. Resta, P. Santi, "The k-Neighbors Protocol for Symmetric Topology Control in Ad Hoc Networks", Tech. Rep. IIT-TR-23/2002, Istituto di Informatica e Telematica, Pisa -- Italy, Dec. 2002.
 
5
S.A. Borbash, E.H. Jennings, "Distributed Topology Control Algorithm for Multihop Wireless Networks", Proc. IEEE Int. Joint Conference on Neural Networks, pp. 355--360, 2002.
 
6
J. Bruck, M. Franceschetti, L. Schulman, "Microcellular Systems, Random Walks, and Wave Propagation", Proc. IEEE Symposium on Antennas and Propagation, pp. 220--223, 2002.
 
7
J. Chang, L. Tassiulas, "Energy Conserving Routing in Wireless Ad Hoc Networks", Proc. IEEE INFOCOM 2000, pp. 22--31, 2000.
 
8
 
9
L. Girod, D. Estrin, "Robust Range Estimation Using Acoustic and Multimodal Sensing", IEEE/RSJ International Conference on Intelligent Robots and Systems, 2001.
 
10
P. Gupta, P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks", Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, pp. 547--566, 1998.
 
11
Z. Huang, C. Shen, C. Srisathapornphat, C. Jaikaeo, "Topology Control for Ad Hoc Networks with Directional Antennas", Proc. IEEE Int. Conference on Computer Communications and Networks, pp. 16--21, 2002.
12
 
13
V. Kawadia, P.R. Kumar, "Power Control and Clustering in Ad Hoc Networks", to appear in Proc. IEEE Infocom 03, 2003.
 
14
15
16
 
17
J. Liu, B. Li, "MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks", Proc. IEEE Int. Conference on Computer Communications and Networks, pp. 570--574, 2002.
18
 
19
S. Narayanaswamy, V. Kawadia, R.S. Sreenivas, P.R. Kumar, "Power Control in Ad Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol", Proc. European Wireless 2002, pp. 156--162, 2002.
 
20
 
21
M.R. Pearlman, Z.J. Haas, B.P. Manvell, "Using Multi-Hop Acknowledgements to Discover and Reliably Communicate over Unidirectional Links in Ad Hoc Networks", Proc. Wireless Communications and Networking Conference (WCNC), pp. 532--537, 2000.
 
22
 
23
R. Ramanathan, R. Rosales-Hain, "Topology Control of Multihop Wireless Networks using Transmit Power Adjustment", Proc. IEEE Infocom 2000, pp. 404--413, 2000.
 
24
V. Ramasubramanian, R. Chandra, D. Mosse, "Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks", Proc. IEEE Infocom 02, pp. 1258--1267, 2002.
 
25
V. Rodoplu, T.H. Meng, "Minimum Energy Mobile Wireless Networks", IEEE Journal Selected Areas in Comm., Vol. 17, n. 8, pp. 1333--1344, 1999.
 
26
M. Sanchez, P. Manzoni, Z.J. Haas, "Determination of Critical Transmitting Range in Ad Hoc Networks", Proc. Multiaccess, Mobility and Teletraffic for Wireless Communications Conference, 1999.
 
27
28
29
 
30
R. Wattenhofer, L. Li, P. Bahl, Y. Wang, "Distributed Topology Control for Power Efficient Operation in Multihop Wireless Ad Hoc Networks", Proc. IEEE Infocom 2001, pp. 1388--1397, 2001.
 
31
F. Xue, P.R. Kumar, "The Number of Neighbors Needed for Connectivity of Wireless Networks", internet draft, available at http://decision.csl.uiuc.edu/prkumar/postscript_files.html#Wireless%20Networks.

CITED BY  29

Collaborative Colleagues:
Douglas M. Blough: colleagues
Mauro Leoncini: colleagues
Giovanni Resta: colleagues
Paolo Santi: colleagues