Sciweavers

1815 search results - page 123 / 363
» Path Planning for Network Performance
Sort
View
CONEXT
2007
ACM
14 years 6 days ago
Practical service provisioning for wireless meshes
Community wireless mesh networks (WMNs) are increasingly being deployed for providing cheap, low maintenance Internet access. For the successful adoption of WMNs as a last-mile te...
Saumitra M. Das, Dimitrios Koutsonikolas, Y. Charl...
SENSYS
2003
ACM
14 years 1 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
INFOCOM
2008
IEEE
14 years 2 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
INFOCOM
2007
IEEE
14 years 2 months ago
End-to-End Routing for Dual-Radio Sensor Networks
— Dual-radio, dual-processor nodes are an emerging class of Wireless Sensor Network devices that provide both lowenergy operation as well as substantially increased computational...
Thanos Stathopoulos, Martin Lukac, Dustin McIntire...
ICDCS
2010
IEEE
13 years 8 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...