Sciweavers

1571 search results - page 185 / 315
» Dynamic Routing Selection for Wireless Sensor Networks
Sort
View
NAS
2010
IEEE
15 years 1 months ago
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu
MOBICOM
2003
ACM
15 years 8 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
INFOCOM
2010
IEEE
15 years 1 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
MOBIQUITOUS
2007
IEEE
15 years 9 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
PERCOM
2007
ACM
16 years 2 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...