Sciweavers

522 search results - page 76 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 7 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
RAID
2010
Springer
13 years 6 months ago
Anomaly Detection and Mitigation for Disaster Area Networks
Abstract. One of the most challenging applications of wireless networking are in disaster area networks where lack of infrastructure, limited energy resources, need for common oper...
Jordi Cucurull, Mikael Asplund, Simin Nadjm-Tehran...
GLOBECOM
2007
IEEE
13 years 7 months ago
Path Planning for Network Performance
— Path planning and network design are often treated by architects of mobile communication networks as separate problems. In fact, most mobile ad hoc network (MANET) designs do n...
Alex Fridman, Steven Weber, Charles Graff, Moshe K...
MOBICOM
2009
ACM
14 years 2 months ago
Connectivity of cognitive radio networks: proximity vs. opportunity
We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existenc...
Wei Ren, Qing Zhao, Ananthram Swami
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu