Sciweavers

90 search results - page 14 / 18
» Fault-tolerant graphs for tori
Sort
View
ISCC
2009
IEEE
254views Communications» more  ISCC 2009»
14 years 2 months ago
Monitoring connectivity in wireless sensor networks
It is important to have continuous connectivity in a wireless sensor network after it is deployed in a hostile environment. However, such networks are constrained by the low usert...
Benahmed Khelifa, Hafid Haffaf, Madjid Merabti, Da...
INFOCOM
2009
IEEE
14 years 2 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
LCN
2008
IEEE
14 years 2 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
13 years 8 months ago
An evolutionary design technique for collective communications on optimal diameter-degree networks
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
Jirí Jaros, Vaclav Dvorak
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez