Sciweavers

2722 search results - page 84 / 545
» Hastily formed networks
Sort
View
ICT
2004
Springer
156views Communications» more  ICT 2004»
14 years 3 months ago
An Architecture for Publishing and Distributing Service Components in Active Networks
- Application level active networks provide a way of transforming the current network infrastructure into one where new services and protocols are more easily adopted and utilized ...
Nikolaos D. Dragios, Constantine Harbilas, Konstan...
ICPP
1998
IEEE
14 years 2 months ago
The Postal Network: A Versatile Interconnection Topology
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibona...
Jie Wu, Yuanyuan Yang
JNW
2006
147views more  JNW 2006»
13 years 10 months ago
Dependability Considerations in Wireless Sensor Networks Applications
Recently, the use of wireless sensor networks has spread to applications areas that are not viable or costefficient to be run on other types of networks. Due to some critical tasks...
Amirhosein Taherkordi, Majid Alkaee Taleghan, Mohs...
INFOCOM
2000
IEEE
14 years 2 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 10 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar