Topology Control in Wireless Ad Hoc and Sensor Networks

Topology Control in Wireless Ad Hoc and Sensor Networks

Volumn , Issue , 2005, Pages 1-252

  Santi, Paolo ^a  

^a Istituto di Informatica e Telematica del CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889485812     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0470094559     Document Type: Book

References (169)

1. Aldous D and Steele J 1992 Asymptotics for euclidean minimal spanning trees on random points. Probability Theory Related Fields 92, 247-258.
2. Althaus E, Calinescu G, Mandoiu I, Prasad S, Tchervenski N and Zelikovsky A 2003 Power efficient range assignment in ad hoc wireless networks. Proc. IEEE WCNC 03, New Orleans, LA, pp. 1889-1894.
3. Anderegg L and Eidenbenz S 2003 Ad hoc-vcg: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. Proc. ACM Mobicom, San Diego, CA, pp. 245-259.
4. Appel M and Russo R 1997a The maximum vertex degree of a graph on uniform points in [0, 1]d. Advances in Applied Probability 29, 567-581.
5. Appel M and Russo R 1997b The minimum vertex degree of a graph on uniform points in [0, 1]d. Advances in Applied Probability 29, 582-594.
6. Avram F and Bertsimas D 1992 The minimum spanning tree constant in geometrical probability and under the independent model: a unified approach. Annals of Applied Probability 2(1), 113-130.
7. Avram F and Bertsimas D 1993 On central limit theorems in geometrical probability. Annals of Applied Probability 3(4), 1003-1046.
8. Bahramgiri M, Hajiaghayi M and Mirrokni V 2002 Fault-tolerant ad 3-dimensional distributed topol-ogy control algorithms in wireless multi-hop networks. Proc. IEEE International Conference on Computer Communications and Networks, Dallas, TX, pp. 392-397.
9. Bai F, Sadagopan N and Helmy A 2003 Important: a framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks. Proc. IEEE Infocom, San Francisco, CA, pp. 825-835.
10. Bao L and Garcia-Luna-Aceves J 2001 Channel access scheduling in ad hoc networks with unidirec-tional links. Proc. DIALM 01, Rome, pp. 9-18.
11. BenSalem N, Buttyan L, Hubaux J and Jakobsson M 2003 A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. Proc. ACM MobiHoc, Annapolis, MD, pp. 13-24.
12. Bettstetter C 2001a Mobility modeling in wireless networks: categorization, smooth movement, and border effects. ACM Mobile Computing and Communications Review 5(3), 55-67.
13. Bettstetter C 2001b Smooth is better than sharp: a random mobility model for simulation of wireless networks. Proc. ACM Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Rome, pp. 19-27.
14. Bettstetter C 2002 On the minimum node degree and connectivity of a wireless multihop network. Proc. ACM MobiHoc 02, Lausanne, pp. 80-91.
15. Bettstetter C 2004 Failure-resilient ad hoc and sensor networks in a shadow fading environment. Proc. IEEE Workshop on Dependability Issues in Ad Hoc Networks and Sensor Networks (DIWANS), Florence.
16. Bettstetter C and Krause O 2001 On border effects in modeling and simulation of wireless ad hoc networks. Proc. IEEE International Conference on Mobile and Wireless Communication Network (MWCN), Recife.
17. Bettstetter C, Resta G and Santi P 2003 The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257-269.
18. Blough D, Leoncini M, Resta G and Santi P 2002 On the symmetric range assignment problem in wireless ad hoc networks. Proc. IFIP Conference on Theoretical Computer Science, Montreal, pp. 71-82.
19. Blough D, Leoncini M, Resta G and Santi P 2003a The k-neighbors Approach to Physical Degree Bounded and Symmetric Topology Control in ad hoc networks. Technical Report IIT-TR-14/2003, Istituto di Informatica e Telematica, Pisa.
20. Blough D, Leoncini M, Resta G and Santi P 2003b The k-neighbors protocol for symmetric topology control in ad hoc networks. Proc. ACM MobiHoc 03, Annapolis, MD, pp. 141-152.
21. Blough D, Leoncini M, Resta G and Santi P 2003c K-neighlev: A Practical Realization of Neighborhood-based Topology Control in ad hoc Networks. Technical Report IIT-TR-09/2003, Isti-tuto di Informatica e Telematica, Pisa.
22. Blough D, Resta G and Santi P 2004 A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks. Wireless Networks 10, 543-554.
23. Blough D and Santi P 2002 Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks. Proc. ACM Mobicom, Atlanta, GA, pp. 183-192.
24. Bluetooth 1999 Bluetooth specifications available at http://www.bluetooth.org.
25. Bollobás B 1985 Random Graphs. Academic Press, London.
26. Bollobás B 1998 Modern Graph Theory. Springer-Verlag, New York.
27. Booth L, Bruck J, Cook M and Franceschetti M 2003 Ad hoc wireless networks with noisy links. Proc. IEEE International Symposium on Information Theory (ISIT), Yokohama.
28. Borbash S and Jennings E 2002 Distributed topology control algorithm for multihop wireless networks. Proc. IEEE International Joint Conference on Neural Networks, Honolulu, HI, pp. 355-360.
29. Bose P, Morin P, Stojmenovic I and Urrutia J 2001 Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609-616.
30. Buchegger S and LeBoudec J 2002a Nodes bearing grudges: towards routing security, fairness and robustness in mobile ad hoc networks. Proc. Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, pp. 403-410.
31. Buchegger S and LeBoudec J 2002b Performance analysis of the confidant protocol: cooperation of nodes-fairness in dynamic ad hoc networks. Proc. ACM Mobihoc, Lausanne, pp. 226-236.
32. Burkhart M, Rickenbach PV, Wattenhofer R and Zollinger A 2004 Does topology control reduce interference? Proc. ACM MobiHoc 04, Lausanne, pp. 9-19.
33. Buttyan L and Hubaux J 2001 Nuglets: A Virtual Currency to Stimulate Cooperation in Self-Organized ad Hoc Networks. EPFL Technical Report 2001-01-01.
34. Buttyan L and Hubaux J 2003 Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile Networks and Applications 8(5), 579-592.
35. Cagali M, Hubaux J and Enz C 2002 Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. Proc. ACM Mobicom 02, Atlanta, GA, pp. 172-182.
36. Calinescu G, Mandoiu I and Zelikovsky A 2002 Symmetric connectivity with minimum power con-sumption in radio networks. Proc. IFIP Conference on Theoretical Computer Science, Montreal, pp. 119-130.
37. Camp T, Boleng J and Davies V 2002 Mobility models for ad hoc network simulations. Wiley Wireless Communication & Mobile Computing (WCMC) 2(5), 483-502.
38. Cisco 2004 Aironet data sheets available at http://www.cisco.com/en/US/products/hw/wireless.
39. Clarke E 1971 Multipart pricing of public goods. Public Choice 11, 17-33.
40. Clementi A, Penna P and Silvestri R 1999 Hardness results for the power range assignment problem in packet radio networks. Proc. 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX'99), Berkeley, CA, pp. 197-208.
41. Couto DD, Aguayo D, Bicket J and Morris R 2003 A high-throughput metric for multi-hop wireless routing. Proc. ACM Mobicom, San Diego, CA, pp. 134-146.
42. CrossBowTechnologies 2004 Motes data sheets available at http://www.xbow.com.
43. deBerg M, VanKreveld M, Overmars M and Schwarzkopf O 1997 Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin Heidelberg.
44. Dette H and Henze N 1989 The limit distribution of the largest nearest neighbor link in the unit d-cube. Journal of Applied Probability 26, 67-80.
45. Dousse O, Baccelli F and Thiran P 2003 Impact of interferences on connectivity in ad hoc networks. Proc. IEEE Infocom 03, San Francisco, CA, pp. 1724-1733.
46. Dousse O, Mannersalo P and Thiran P 2004 Latency of wireless sensor networks with uncoordinated power saving mechanisms. Proc. ACM Mobihoc, Tokyo, pp. 109-120.
47. Dousse O, Thiran P and Hasler M 2002 Connectivity in ad hoc and hybrid networks. Proc. IEEE Infocom 02, New York, pp. 1079-1088.
48. Ebert J, Aier S, Kofahl G, Becker A, Burns B and Wolisz A 2002 Measurement and Simulation of the Energy Consumption of a Wlan Interface. Technical Report TKN-02-010, Technical University of Berlin.
49. Efstathiou E and Polyzos G 2005 Fully self-organized fair peering of wireless hotspots. Wiley European Transactions on Telecommunications, to appear.
50. Eidenbenz S, Kumar V and Zust S 2003 Equilibria in topology control games for ad hoc networks. Proc. ACM DIALM-POMC, San Diego, CA, pp. 2-11.
51. Eidenbenz S, Resta G and Santi P 2005 Commit: a sender-centric, truthful, and energy-efficient routing protocol for ad hoc networks. Proc. IEEE Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), Denver, CO to appear.
52. Faragó A 2002 Scalable analysis and design of ad hoc networks via random graph theory. Proc. ACM DIAL-M 02, Atlanta, GA, pp. 43-50.
53. Feeney L and Nilsson M 2001 Investigating the energy efficiency of a wireless network interface in an ad hoc networking environment. Proc. IEEE Infocom, Anchorage, AK, pp. 1548-1557.
54. Feigenbaum J, Papadimitriou C, Sami R and Shenker S 2002 A bgp-based mechanism for lowest-cost routing. Proc. ACM Conference on Principles of Distributed Computing (PODC), Monterey, CA, pp. 173-182.
55. Feller W 1957 An Introduction to Probability Theory and its Applications. John Wiley and Sons, New York.
56. Franceschetti M, Booth L, Cook M, Meester R and Bruck J 2005 Continuum percolation with unre-liable and spread-out connections. Journal of Statistical Physics 118(3/4).
57. Frost and Sullivan 2003 Wireless sensors and integrated wireless sensor networks. Frost and Sullivan Report.
58. Gao J, Guibas L, Hershberger J, Zhang L and Zhu A 2001 Geometric spanners for routing in mobile networks. Proc. ACM MobiHoc 01, Long Beach, CA, pp. 45-55.
59. Garcia-Luna-Aceves J and Behrens J 1995 Distributed scalable routing based on vectors of link states. IEEE Journal Selected Areas in Communication 13(8), 1383-1395.
60. Garey M and Johnson D 1977 The rectilinear steiner tree problem is np-complete. SIAM Journal of Applied Mathematics 32, 826-834.
61. Girod L and Estrin D 2001 Robust range estimation using acoustic and multimodal sensing. Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, Maui, HI.
62. Goodman J and O'Rourke J 1997 Handbook of Discrete and Computational Geometry. CRC Press, New York.
63. Grossglauser M and Tse D 2001 Mobility increases the capacity of ad hoc wireless networks. Proc. IEEE Infocom 01, Anchorage, AK, pp. 1360-1369.
64. Groves T 1973 Incentive in teams. Econometrica 41, 617-663.
65. Gupta P and Kumar P 1998 Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, MA, pp. 547-566.
66. Gupta P and Kumar P 2000 The capacity of wireless networks. IEEE Transactions Information Theory 46(2), 388-404.
67. Haas Z and Pearlman M 1998 The performance of query control schemes for the zone routing protocol. Proc. ACM Sigcomm, Vancouver, pp. 167-177.
68. Hajek B 1983 Adaptive transmission strategies and routing in mobile radio networks. Proc. Conference on Information Sciences and Systems, Baltimore, MD, pp. 373-378.
69. Hajiaghayi M, Immorlica N and Mirrokni V 2003 Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Proc. ACM Mobicom 03, San Diego, CA, pp. 300-312.
70. Holst L 1980 On multiple covering of a circle with random arcs. Journal of Applied Probability 16, 284-290.
71. Hong X, Gerla M, Pei G and Chiang C 1999 A group mobility model for ad hoc wireless networks. Proc. ACM MSWiM, Seattle, WA, pp. 53-60.
72. Hou T and Li V 1986 Transmission range control in multihop packet radio networks. IEEE Transactions on Communications COM-34, 38-44.
73. Huang Z, Shen C, Srisathapornphat C and Jaikaeo C 2002 Topology control for ad hoc networks with directional antennas. Proc. IEEE International Conference on Computer Communications and Networks, Dallas, TX, pp. 16-21.
74. IEEE 1999 Ansi/IEEE Standard 802.11: Medium Access Control and Physical Specifications. Sect. 15.
75. IEEE 2004 Ieee antennas & propagation society http://www.ieeeaps.org.
76. Jain K, Padhye J, Padmanabhan V and Qiu L 2003 Impact of interference on multi-hop wireless network performance. Proc. ACM Mobicom, San Diego, CA, pp. 66-80.
77. Jardosh A, Belding-Royer E, Almeroth K and Suri S 2003 Towards realistic mobility models for mobile ad hoc networks. Proc. ACM Mobicom, pp. 217-229.
78. Johnson D and Maltz D 1996 Dynamic source routing in ad hoc wireless networks. Mobile Computing. Kluwer Academic Publishers, pp. 153-181.
79. Johnson D, Maltz D, Hu Y and Jetcheva J 2002 The Dynamic Source Routing Protocol for Mobile ad hoc Networks (dsr). Internet Draft draft-ietf-manet-dsr-7.txt, Mobile Ad Hoc Networking Working Group.
80. Jung A and Vaidya N 2002 A power control mac protocol for ad hoc networks. Proc. ACM Mobicom, Atlanta, GA, pp. 36-47.
81. Karp B and Kung H 2000 Gpsr: greedy perimeter stateless routing for wireless networks. Proc. ACM Mobicom, Boston, MA, pp. 243-254.
82. Kawadia V and Kumar P 2003 Power control and clustering in ad hoc networks. Proc. IEEE Infocom, San Francisco, CA, pp. 459-469.
83. Khun F, Wattenhofer R and Zollinger A 2003 Worst-case optimal and average-case efficient geometric ad hoc routing. Proc. ACM MobiHoc, Annapolis, MD, pp. 267-278.
84. Kim D, Toh C and Choi Y 2001 On supporting link asymmetry in mobile ad hoc networks. Proc. IEEE Globecom 01, San Antonio, TX, pp. 2798-2803.
85. Kirousis L, Kranakis E, Krizanc D and Pelc A 2000 Power consumption in packet radio networks. Theoretical Computer Science 243, 289-305.
86. Kleinrock L and Silvester JA 1978 Optimum transmission radii for packet radio networks or why six is a magic number. Proc. IEEE National Telecommunication Conference, Birmingham, AL, pp. 431-435.
87. Kolchin V, Sevast'yanov B and Chistyakov V 1978 Random Allocations. V.H. Winston and Sons, Washington, DC.
88. Krizman K, Biedka T and Rappaport T 1997 Wireless position location: fundamentals, implementation strategies, and source of error. Proc. IEEE Vehicular Technology Conference (VTC), Phoenix, AZ, pp. 919-923.
89. Li L, Halpern J, Bahl P, Wang Y and Wattenhofer R 2001 Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. Proc. ACM PODC 01, Newport, RI, pp. 264-273.
90. Li N and Hou J 2004 Flss: a fault-tolerant topology control algorithm for wireless networks. Proc. ACM Mobicom 04, Philadelphia, PA, pp. 275-286.
91. Li N, Hou J and Sha L 2003 Design and analysis of an mst-based topology control algorithm. Proc. IEEE Infocom 03, San Francisco, CA, pp. 1702-1712.
92. Li X, Wan P, Wang Y and Frieder O 2002 Sparse power efficient topology for wireless networks. Proc. IEEE Hawaii International Conference on System Sciences (HICSS), Big Island, HI.
93. Li X, Wang Y and Song W 2004 Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 15(12), 1057-1069.
94. Liang W 2002 Constructing minimum-energy broadcast trees in wireless ad hoc networks. Proc. ACM Mobihoc 02, Lausanne. pp. 112-122.
95. Liu J and Li B 2002 Mobilegrid: capacity-aware topology control in mobile ad hoc networks. Proc. IEEE International Conference on Computer Communications and Networks, Dallas, TX, pp. 570-574.
96. Lynch N 1996 Distributed Algorithms. Morgan Kaufmann, San Mateo, CA.
97. Mainwaring A, Polastre J, Szewczyk R, Culler D and Anderson J 2002 Wireless sensor networks for habitat monitoring. Proc. ACM Workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, GA, pp. 88-97.
98. Marina M and Das S 2002 Routing performance in the presence of unidirectional links in multihop wireless networks. Proc. ACM Mobihoc 02, Lausanne, pp. 12-23.
99. Marti S, Giuli T, Lai K and Baker M 2000 Mitigating routing misbehavior in mobile ad hoc networks. Proc. ACM Mobicom 00, Boston, MA, pp. 255-265.
100. Mas-Colell A, Whinston M and Green J 1995 Microeconomic Theory. Oxford University Press, New York.
101. Meester R and Roy R 1996 Continuum Percolation. Cambridge University Press, Cambridge, MA.
102. Meyer Auf Der Heide F, Schindelhauer C and Grunewald M 2002 Congestion, dilation, and energy in radio networks. Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, pp. 10-13.
103. Michiardi P and Molva R 2002 Core: a collaborative repudiation mechanism to enforce node coop-eration in mobile ad hoc networks. Proc. IFIP Conference on Security, Communications and Multimedia, Washington, DC.
104. Moaveni-Nejad K and Li X 2005 Low-interference topology control for wireless ad hoc networks. Ad Hoc and Sensor Networks: an International Journal, 1(1-2), pp. 41-64.
105. Narayanaswamy S, Kawadia V, Sreenivas R and Kumar P 2002 Power control in ad hoc networks: the-ory, architecture, algorithm and implementation of the compow protocol. Proc. European Wireless 2002, Florence, pp. 156-162.
106. Ni S, Tseng Y, Chen Y and Sheu J 1999 The broadcast storm problem in mobile ad hoc networks. Proc. ACM Mobicom, Seattle, WA, pp. 151-162.
107. Niculescu D and Nath B 2003 Ad hoc positioning system (aps) using aoa. Proc. IEEE Infocom 03, San Francisco, CA, pp. 1734-1743.
108. Nisan N and Ronen A 2001 Algorithmic mechanism design. Games and Economic Behavior 35, 166-196.
109. Ns2 2002 The network simulator-ns-2 http://www.isi.edu/nsnam/ns/.
110. Osborne M and Rubinstein A 1994 A Course in Game Theory. MIT Press, Binghamton, NY.
111. Palmer E 1985 Graphical Evolution. John Wiley and Sons, New York.
112. Panchapakesan P and Manjunath D 2001 On the transmission range in dense ad hoc radio networks. Proc. IEEE SPCOM 2001, Bangalore.
113. Pearlman M, Haas Z and Manvell B 2000a Using multi-hop acknowledgements to discover and reliably communicate over unidirectional links in ad hoc networks. Proc. Wireless Communications and Networking Conference (WCNC), Chicago, IL, pp. 532-537.
114. Pearlman M, Haas Z, Sholander P and Tabrizi S 2000b On the impact of alternate path routing for load balancing in mobile ad hoc networks. Proc. ACM MobiHoc, Boston, MA, pp. 3-10.
115. Penrose M 1997 The longest edge of the random minimal spanning tree. The Annals of Applied Probability 7(2), 340-361.
116. Penrose M 1998 Extremes for the minimal spanning tree on normally distributed points. Advances in Applied Probability 30, 628-639.
117. Penrose M 1999a On k-connectivity for a geometric random graph. Random Structures and Algorithms 15(2), 145-164.
118. Penrose M 1999b A strong law for the largest nearest-neighbour link between random points. Journal of London Mathematical Society 60(2), 951-960.
119. Penrose M 1999c A strong law for the longest edge of the minimal spanning tree. The Annals of Probability 27(1), 246-260.
120. Penrose M 2003 Random Geometric Graphs. Oxford University Press, Oxford.
121. Penrose M and Yukich J 2001 Central limit theorems for some graphs in computational geometry. Annals of Applied Probability 11, 1005-1041.
122. Perkins C, Belding-Royer E and Das S 2002 Ad hoc on-demand distance vector (aodv) routing. Internet Draft Draft-ietf-manet-aodv-12.txt, Mobile Ad Hoc Networking Working Group.
123. Perkins C and Bhagwat P 1994 Highly dynamic destination-sequenced distance vector routing (dsdv) for mobile computers. Proc. ACM SigComm, London.
124. Philips T, Panwar S and Tantawi A 1989 Connectivity properties of a packet radio network model. IEEE Transactions Information Theory 35(5), 1044-1047.
125. Piret P 1991 On the connectivity of radio networks. IEEE Transactions Information Theory 37(5), 1490-1492.
126. Pister K 2001 The smart dust project http://robotics.eecs.berkeley.edu/~pister/SmartDust/.
127. Polastre J, Szewczyk R, Sharp C and Culler D 2004 The mote revolution: low power wireless sensor network devices. Proc. Hot Chips 16: A Symposium on High Performance Chips, Stanford, CA.
128. Prakash R 2001 A routing algorithm for wireless ad hoc networks with unidirectional links. ACM/Kluwer Wireless Networks 7(6), 617-625.
129. Prim R 1957 Shortest connection networks and some generalizations. The Bell System Technical Journal 36, 1389-1401.
130. Priyantha N, Chakraborty A and Balakrishnan H 2000 The cricket location-support system. Proc. ACM Mobicom 00, Boston, MA, pp. 32-43.
131. Raghunathan V, Schurgers C, Park S and Srivastava M 2002 Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine 19(2), 40-50.
132. Ramanathan R and Rosales-Hain R 2000 Topology control of multihop wireless networks using transmit power adjustment. Proc. IEEE Infocom 00, Tel Aviv, pp. 404-413.
133. Ramanathan S and Steenstrup M 1998 Hierarchically-organized multi-hop mobile networks for mul-timedia support. Mobile Networks and Applications 3(1), 101-119.
134. Ramasubramanian V, Chandra R and Mosse D 2002 Providing a bidirectional abstraction for unidi-rectional ad hoc networks. Proc. IEEE Infocom 02, New York, pp. 1258-1267.
135. Rappaport T 2002 Wireless Communications: Principles and Practice, Second Edition. Prentice Hall, Upper Saddle River, NJ.
136. RockwellScienceCenter 2004 The wins project available at http://wins.rsc.rockwell.com.
137. Rodoplu V and Meng T 1999 Minimum energy mobile wireless networks. IEEE Journal Selected Areas in Communication 17(8), 1333-1344.
138. Royer E, Melliar-Smith P and Moser L 2001 An analysis of the optimum node density for ad hoc mobile networks. Proc. IEEE International Conference on Communications, Helsinki, pp. 857-861.
139. Santi P 2005 The critical transmitting range for connectivity in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4(3), pp. 310-317.
140. Santi P and Blough D 2002 An evaluation of connectivity in mobile wireless ad hoc networks. Proc. IEEE DSN 2002, Bethesda, MD, pp. 89-98.
141. Santi P and Blough D 2003 The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(1), 25-39.
142. Savvides A, Han C and Srivastava M 2001 Dynamic fine-grained localization in ad hoc networks of sensors. Proc. ACM Mobicom 01, Rome, pp. 166-179.
143. Sen A and Huson M 1996 A new model for scheduling packet radio networks. Proc. IEEE Infocom, San Francisco, CA, pp. 1116-1124.
144. Shih E, Bahl P and Sinclair M 2002 Wake on wireless: an event driven energy saving strategy for battery operated devices. Proc. ACM Mobicom, Atlanta, GA, pp. 160-171.
145. Song W, Wang Y, Li X and Frieder O 2004 Localized algorithms for energy efficient topology in wireless ad hoc networks. Proc. ACM MobiHoc, Tokyo, pp. 98-108.
146. Steele J 1981 Subadditive euclidean functionals and nonlinear growth in geometric probability. Annals of Probability 9(3), 365-376.
147. Steele J 1988 Growth rates of euclidean minimal spanning trees with power weighted edges. Annals of Probability 16, 1767-1787.
148. Steele J and Tierney L 1986 Boundary domination and the distribution of the largest nearest neighbor link in higher dimensions. Journal of Applied Probability 23, 524-528.
149. Takagi H and Kleinrock L 1984 Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications COM-32, 246-257.
150. Vickrey W 1961 Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance 16, 8-37.
151. Wan P, Calinescu G, Li X and Frieder O 2002 Minimum energy broadcasting in static ad hoc wireless networks. ACM/Kluwer Wireless Networks 8(6), 607-617.
152. Wan P and Yi C 2004 Asymptotical critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. Proc. ACM MobiHoc 04, Tokyo, pp. 1-8.
153. Wang K and Li B 2002 Group mobility and partition prediction in wireless ad hoc networks. Proc. IEEE International Conference on Communications, New York, pp. 1017-1021.
154. Wang W and Li X 2004 Truthful multicast routing in selfish wireless networks Proc. ACM Mobicom, Philadelphia, PA, pp. 245-259.
155. Wang Y, Li X and Frieder O 2002 Distributed spanners with bounded degree for wireless ad hoc networks. International Journal of Foundations of Computer Science, 14(2), pp. 183-200.
156. Wang X, Xing G, Zhang Y, Lu C, Pless R and Gill C 2003 Integrated coverage and connectivity configuration in wireless sensor networks. Proc. ACM SenSys, Los Angeles, CA, pp. 28-39.
157. Wattenhofer R, Li L, Bahl P and Wang Y 2001 Distributed topology control for power efficient operation in multihop wireless ad hoc networks. Proc. IEEE Infocom 01, Anchorage, Alaska, pp. 1388-1397.
158. Wattenhofer R and Zollinger A 2004 Xtc: A practical topology control algorithm for ad hoc net-works. 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN).Santa Fe, NM.
159. Wieselthier J, Nguyen G and Ephremides A 2000 On the construction of energy-efficient broadcast and multicast trees in wireless networks. Proc. IEEE Infocom 00, Tel Aviv, pp. 585-594.
160. Xue F and Kumar P 2004 The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10(2), 169-181.
161. Yi C and Wan P 2005 Asymptotic critical transmission ranges for connectivity in wireless ad hoc networks with bernoulli nodes. Proc. IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, LA (to appear).
162. Yi C, Wan P, Li X and Frieder O 2003 Asymptotic distribution of the number of isolated nodes in wire-less ad hoc networks with bernoulli nodes. Proc. IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, LA, pp. 1585-1590.
163. Yoon J, Liu M and Noble B 2003 Random waypoint considered harmful. Proc. IEEE Infocom, San Francisco, CA, pp. 1312-1321.
164. Younis O and Fahmy S 2004 Heed: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing 3(4), 366-379.
165. Younis O, Fahmy S and Santi P 2004 Robust communications for sensor networks in hostile environ-ments. Proc. IEEE Internation Workshop on Quality of Service (IWQoS), Montreal, pp. 10-19.
166. Yukich J 2000 Asymptotics for weighted minimal spanning trees on random points. Stochastic Processes and their Application 85, 123-128.
167. Zeng X, Bagrodia R and Gerla M 1998 Glomosim: a library for parallel simulation of large-scale wireless networks. Workshop on Parallel and Distributed Simulations (PADS), Banff, Alberta.
168. Zhong S, Yang Y and Chen J 2003 Sprite: a simple, cheat-proof, credit-based system for mobile ad hoc networks. Proc. IEEE Infocom, San Francisco, CA, pp. 1987-1997.
169. ZigBeeAlliance 2004 http://www.zigbee.org.