Sciweavers

2796 search results - page 491 / 560
» The coolest path problem
Sort
View
TMC
2010
138views more  TMC 2010»
15 years 10 days ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
TON
2010
163views more  TON 2010»
15 years 10 days ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
WICOMM
2010
143views more  WICOMM 2010»
15 years 9 days ago
Routing for cognitive radio networks consisting of opportunistic links
Cognitive radio (CR) has been considered a key technology to enhance overall spectrum utilization by opportunistic transmissions in CR transmitter-receiver link(s). However, CRs m...
Kwang-Cheng Chen, Bilge Kartal Cetin, Yu-Cheng Pen...
IMC
2010
ACM
14 years 12 months ago
Network tomography on correlated links
Network tomography establishes linear relationships between the characteristics of individual links and those of end-toend paths. It has been proved that these relationships can b...
Denisa Ghita, Katerina J. Argyraki, Patrick Thiran
INFOCOM
2010
IEEE
14 years 12 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu