Sciweavers

2507 search results - page 326 / 502
» Wireless Network Information Flow
Sort
View
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
CISS
2008
IEEE
14 years 2 months ago
Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
Junshan Zhang
CNSR
2008
IEEE
189views Communications» more  CNSR 2008»
14 years 2 months ago
Secure Health Monitoring Network against Denial-Of-Service Attacks Using Cognitive Intelligence
Secure and energy efficient transmission is a main concern in many wireless sensor network applications. In this paper, two types of denial-of-service attacks that affect the rout...
Rajani Muraleedharan, Lisa Ann Osadciw
ADHOCNOW
2004
Springer
14 years 1 months ago
Range-Free Ranking in Sensors Networks and Its Applications to Localization
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
Zvi Lotker, Marc Martinez de Albeniz, Stephane Per...
INFOCOM
2010
IEEE
13 years 6 months ago
Delay-Based Network Utility Maximization
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...
Michael J. Neely