Sciweavers

5901 search results - page 1111 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
MOBIHOC
2005
ACM
15 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
SECON
2008
IEEE
15 years 4 months ago
Optimal Buffer Management Policies for Delay Tolerant Networks
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
MOBIHOC
2004
ACM
15 years 3 months ago
On the behavior of communication links of a node in a multi-hop mobile environment
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
Prince Samar, Stephen B. Wicker
PODC
2009
ACM
15 years 10 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
« Prev « First page 1111 / 1181 Last » Next »