Sciweavers

4962 search results - page 131 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
JCIT
2008
138views more  JCIT 2008»
15 years 6 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
RTSS
1999
IEEE
15 years 10 months ago
Parallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
DCOSS
2006
Springer
15 years 10 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
JPDC
2007
112views more  JPDC 2007»
15 years 6 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 6 months ago
Dynamic Connectivity in ALOHA Ad Hoc Networks
We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination fr...
Radha Krishna Ganti, Martin Haenggi