Sciweavers

2200 search results - page 37 / 440
» Hop Integrity in Computer Networks
Sort
View
APNOMS
2009
Springer
14 years 2 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ICNP
2005
IEEE
14 years 1 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
HPCC
2011
Springer
12 years 7 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
ICCS
2007
Springer
14 years 1 months ago
Local Link Protection Scheme in IP Networks
In this paper, we proposed an IP Local Link-Protection (IPLLP) scheme based on the characteristic of shortest-path routing in IP networks. Our scheme working in an intra-area routi...
Hui-Kai Su, Cheng-Shong Wu