Showing papers on "Wireless Routing Protocol published in 1969"
TL;DR: A simple-but-effective routing tree algorithm is proposed to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink.
Abstract: This paper proposes a new clustering scheme for wireless sensor networks, which efficiently balances the energy usage inter- and intra-clusters, by using the k - medoids method and the intra-cluster head update policy. Particularly, we propose a simple-but-effective routing tree algorithm to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink. We also conduct simulations with realistic configurations to evaluate our design in terms of system lifetime, by comparing with LEACH. The experimental results show the efficiency and effectiveness of our work.
7 citations
Journal Article•
TL;DR: This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem and proves that the proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.
Abstract: Full network level privacy has often been categorized into four sub-categories:Identity, Route, Location and Data privacy. Achieving full network level privacy is a challenging problem due to the conditions imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). This proposed paper consists of two algorithms IRL algorithm and data privacy mechanism that addresses this problem. The proposed system provides additional trustworthiness, less computation power, less storage space and more reliability. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.
1 citations
TL;DR: Environment adaptive clustering opportunistic routing protocol (EA-COR) is proposed in this paper to improve the unstable communication quality of harsh environment and simulation results show that in a harsh environment EA-COR performs better than the traditional clustering routing and opportunism routing in the aspects of network throughput, energy efficiency, and packet transmission efficiency.
Abstract: Generally, the radio channel quality of a wireless sensor network (WSN) is unstable in harsh environment. For instance, in maritime search and rescue, the nodes of WSN move dynamically, the topology changes with respect to the time and the communication link changes frequently as well. What is more, the given communication distance of nodes can limit the efficiency of routing. In view of these characteristics of wireless sensor networks in a harsh environment, environment adaptive clustering opportunistic routing protocol (EA-COR) is proposed in this paper to improve the unstable communication quality of harsh environment. EA-COR is based on the idea of clustering which combines with the advantages of opportunistic routing. Simulation results show that in a harsh environment EA-COR performs better than the traditional clustering routing and opportunistic routing in the aspects of network throughput, energy efficiency, and packet transmission efficiency
1 citations