Sciweavers

688 search results - page 98 / 138
» Random key-assignment for secure Wireless Sensor Networks
Sort
View
AINA
2007
IEEE
14 years 2 months ago
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 10 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
HPCC
2005
Springer
14 years 1 months ago
An Energy-Efficient Uni-scheduling Based on S-MAC in Wireless Sensor Network
S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sen...
Tae-Seok Lee, Yuan Yang, Ki-Jeong Shin, Myong-Soon...
CN
2010
183views more  CN 2010»
13 years 8 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi