2149 search results - page 194 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
116
click to vote
INFOCOM
2010
IEEE
15 years 4 days ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
115
click to vote
ICPPW
2005
IEEE
15 years 7 months ago
2005
IEEE
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
117
click to vote
FTDB
2011
14 years 5 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
112
Voted
EMO
2005
Springer
15 years 7 months ago
2005
Springer
Water systems often allow efficient water uses via water reuse and/or recirculation. Defining the network layout connecting water-using processes is a complex problem which involv...