Sciweavers

140 search results - page 27 / 28
» CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorith...
Sort
View
IPPS
2005
IEEE
13 years 11 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
WSNA
2003
ACM
13 years 11 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
NETWORKING
2007
13 years 7 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
ECRTS
2007
IEEE
14 years 4 days ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher
SPAA
2005
ACM
13 years 11 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...