ACM Home Page
Please provide us with feedback. Feedback
Constructing minimum energy mobile wireless networks
Full text PdfPdf (183 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing table of contents
Long Beach, CA, USA
Poster session: Poster abstracts table of contents
Pages: 283 - 286  
Year of Publication: 2001
ISBN:1-58113-428-2
Authors
Xiang-Yang Li  Department of Computer Science, Illinois Institute of Technogy, Chicago, IL
Peng-Jun Wan  Department of Computer Science, Illinois Institute of Technogy, Chicago, IL
Sponsor
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): 25,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1145/501449.501460

ABSTRACT

Given a set of wireless network nodes N, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of uv is typically defined as |uv| &agr; + c for a real constant 2 ≤ &gr;≤4 and c & 0. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes. We described a distributed position-based networking protocol to construct the enclosure graph Ge, which is an approximation of Gm. The total communication complexity is O(n). Let dG(u) be the degree of node u in a graph G. The time complexity of each node u is O (dGt)). The space required at each node is O(dGt (u. This improves the previous result that approximates GmO(dGt(u)3) time using O(dGt(u2) spaces. We also show that the average degree dGe (u) is usually a constant, which is at most 6. Our result is first developed for stationary network and then extended to mobile network.


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
E. Kranakis, H. Singh, and J. Urmtia. Compass routing on geometric networks. 2000.
3
 
4
x.Y. Li, P.J. Wan, Y. Wang, Power efficient and sparse spanner for wireless ad hoe networks, ICCCN, 2001.
 
5
C. Perkins. Ad-hoe on-demand distance vector routing. In MILCOM '97, Nov. 1997.
 
6
 
7
v. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. In Proceedings of the 1998 IEEE International Conference on Communications, ICC'98, volume 3, 1998.
 
8
E. Royer and C. Toh. A review of current routing protocols for ad-hoe mobile wireless networks. IEEE Personal Communications, Apr. 1999.


Collaborative Colleagues:
Xiang-Yang Li: colleagues
Peng-Jun Wan: colleagues