TAILIEUCHUNG - Exploring Link Correlation for Efficient Flooding in Wireless Sensor Networks

The attack we propose aims at keystroke eavesdrop- ping. However, the privacy implication of disclosing the ESP/EIP information of other users’ process can be much more significant. With our techniques, such information can be conveniently converted to a system-call sequence that describes the behavior of the process, and some- times, the data it works on and the activities of its users. As a result, sensitive information within the process can be inferred under some circumstances: for example, it is possible to monitor a key-generation program to deduce the secret key it creates for another user, because the key is computed based on random activities within a system, such as mouse moves, keystrokes. | Exploring Link Correlation for Efficient Flooding in Wireless Sensor Networks Ting Zhu Ziguo Zhong Tian He and Zhi-Li Zhang University of Minnesota Twin Cities Abstract Existing flooding algorithms have demonstrated their effectiveness in achieving communication efficiency and reliability in wireless sensor networks. However further performance improvement has been hampered by the assumption of link independence a design premise imposing the need for costly acknowledgements ACKs from every receiver. In this paper we present Collective Flooding CF which exploits the link correlation to achieve flooding reliability using the concept of collective ACKs. CF requires only 1-hop information from a sender making the design highly distributed and scalable with low complexity. We evaluate CF extensively in real-world settings using three different types of testbeds a single hop network with 20 MICAz nodes a multihop network with 37 nodes and a linear outdoor network with 48 nodes along a 326-meter-long bridge. System evaluation and extensive simulation show that CF achieves the same reliability as the state-of-the art solutions while reducing the total number of packet transmission and dissemination delay by 30 50 and 35 50 respectively. 1 Introduction In wireless sensor networks flooding is a protocol that delivers a message from one node to all the other nodes. Flooding is a fundamental operation for time synchronization 15 data dissemination 25 26 17 10 group formation 14 node localization 39 and routing tree formation 6 29 . Existing flooding algorithms 18 34 24 12 have demonstrated their effectiveness in achieving communication efficiency and reliability in wireless sensor networks. Further performance improvement however has been hampered by the implicit assumption of link independence adopted in previous designs. In other words existing flooding algorithms assume that the reception of a flooding message by multiple neighboring nodes is probabilistically independent .

Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.