Sciweavers

5079 search results - page 677 / 1016
» Hidden-Action in Network Routing
Sort
View
ATMOS
2008
124views Optimization» more  ATMOS 2008»
15 years 8 months ago
Simultaneous Network Line Planning and Traffic Assignment
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
Karl Nachtigall, Karl Jerosch
CSREASAM
2006
15 years 8 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
GLOBECOM
2008
IEEE
15 years 7 months ago
Probabilistic Path Selection in Opportunistic Cognitive Radio Networks
Abstract—We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of eve...
Hicham Khalife, Satyajeet Ahuja, Naceur Malouch, M...
COMCOM
2010
90views more  COMCOM 2010»
15 years 6 months ago
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
Li-Hsing Yen, Wei-Ting Tsai
IJSNET
2006
106views more  IJSNET 2006»
15 years 6 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue