Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- New distributed algorithm for connected dominating set in wireless ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Message-optimal connected dominating sets in mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,2002
- Location systems for ubiquitous computingComputer, 2001
- Channel access scheduling in Ad Hoc networks with unidirectional linksPublished by Association for Computing Machinery (ACM) ,2001
- Selecting forwarding neighbors in wireless Ad Hoc networksPublished by Association for Computing Machinery (ACM) ,2001
- L(2,1) -labeling of planar graphsPublished by Association for Computing Machinery (ACM) ,2001
- Unit disk graph recognition is NP-hardComputational Geometry, 1998
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Unit disk graphsDiscrete Mathematics, 1990
- Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio NetworkIEEE Transactions on Computers, 1987