Sciweavers

2001 search results - page 62 / 401
» Local solutions for global problems in wireless networks
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
Sol Lederer, Yue Wang, Jie Gao
MSWIM
2009
ACM
14 years 3 months ago
A performance evaluation framework for fair solutions in ad hoc networks
Fairness in multihop ad hoc networks has received considerable attention in the literature. Many schemes have been proposed, which attempt to compute the “optimal” bit rates o...
Manos Dramitinos, Rémi Vannier, Isabelle Gu...
AHSWN
2010
177views more  AHSWN 2010»
13 years 9 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
INFOCOM
2000
IEEE
14 years 1 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
IPL
2008
145views more  IPL 2008»
13 years 8 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov