Sciweavers

923 search results - page 71 / 185
» A unifying link abstraction for wireless sensor networks
Sort
View
GLOBECOM
2009
IEEE
13 years 7 months ago
Cooperative Communications with Relay Selection for QoS Provisioning in Wireless Sensor Networks
Abstract--Cooperative communications have been demonstrated to be effective in combating the multiple fading effects in wireless networks, and improving the network performance in ...
Xuedong Liang, Ilangko Balasingham, Victor C. M. L...
TON
2010
221views more  TON 2010»
13 years 3 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
SENSYS
2004
ACM
14 years 2 months ago
Practical and robust geographic routing in wireless networks
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
CSUR
2011
13 years 20 days ago
Programming wireless sensor networks: Fundamental concepts and state of the art
high-level programming abstractions, capable of simplifying the programming chore without sacrificing efficiency, has been long recognized and several solutions have been hitherto...
Luca Mottola, Gian Pietro Picco
JCIT
2008
138views more  JCIT 2008»
13 years 9 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