Sciweavers

494 search results - page 38 / 99
» The Conference Call Search Problem in Wireless Networks
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 12 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
WICOMM
2011
13 years 4 months ago
A pragmatic approach to area coverage in hybrid wireless sensor networks
Success of Wireless Sensor Networks (WSN) largely depends on whether the deployed network can provide desired area coverage with acceptable network lifetime. This paper seeks to a...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
COMSWARE
2007
IEEE
14 years 3 months ago
Disruption-Tolerant Link-level Mechanisms for Extreme Wireless Network Environments
— Wireless links pose significant challenges in terms of achievable goodput and residual loss-rate. Our recent enhancements, called LT-TCP make TCP loss-tolerant in heavy/bursty...
Vijaynarayanan Subramanian, K. K. Ramakrishnan, Sh...
INFOCOM
2009
IEEE
14 years 3 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...
COMCOM
2006
110views more  COMCOM 2006»
13 years 9 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak