Loading...
Please wait, while we are loading the content...
Similar Documents
2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) Efficient Flooding in Wireless Sensor Networks Secured with Neighborhood Keys
| Content Provider | CiteSeerX |
|---|---|
| Author | Stoleru, Radu Chen, Jianer Hassanzadeh, Amin |
| Abstract | Abstract—Network flooding is a fundamental communication primitive for Wireless Sensor Networks (WSN). Flooding is used for disseminating code updates and parameter changes, affecting the operation of all nodes in the network. When flooding occurs each node, typically, broadcasts the flooding packet once. The costs for flooding, however, can become significant if neighborhood keys are used for communication (as proposed in recent research on secure localization and key distribution [1]), since, instead of a single broadcast, a node is required to perform several unicast transmissions. In this paper we address the problem of minimizing the number of unicast transmissions required for ensuring 100 % network coverage for flooding in WSN secured with neighborhood keys. We show that the problem is NP-hard and propose an approximation algorithm for solving it. Through simulations, we demonstrate that our algorithm ensures 100 % network coverage for flooding, while requiring, surprisingly, as low as 0.75 packet transmissions per node. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Secure Localization Abstract Network Flooding Unicast Transmission Several Unicast Transmission Mobile Computing Code Update Neighborhood Key Key Distribution Network Coverage International Conference Wireless Sensor Network Secured Single Broadcast Parameter Change Approximation Algorithm Packet Transmission Fundamental Communication Primitive |
| Content Type | Text |
| Resource Type | Article |
