Showing papers on "Dynamic Source Routing 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
01 Oct 1969
TL;DR: An adaptive routing doctrine is defined, which considers the current delays along links of the network, and a device called a dynamic route selector is described, which takes routing decisions according to the most general doctrine discussed.
Abstract: Three practical constraints on the choice of a deterministic routing doctrine for a connected network are defined, leading to a class of doctrines for which a weighted graph of the network exists so that the specified routes are given uniquely by minimum-cost routes through the graph. A technique for finding such a weighted graph is given. An adaptive routing doctrine is defined, which considers the current delays along links of the network. The implementation of such a doctrine is discussed, and a ‘distributed’ solution described which is efficient, decentralised, and resilient under fault conditions. More general adaptive routing doctrines are defined, considering two parameters associated with each link, where the routing of a message may depend on its history as well as its present position and destination. A device called a dynamic route selector is described, which takes routing decisions according to the most general doctrine discussed. It is faster than a digital computer. Finally a method for first introducing deterministic, and then adaptive, routing on a computer-based network is outlined.
6 citations
TL;DR: The problem of finding optimal routings which minimize network losses subject to demand constraints is formulated as a linear program, and extensions to infinite memory and time-varying systems are given.
Abstract: Communication networks with link transit times are modeled by linear graphs with branch time delays and finite branch capacities. Memoryless linear routing strategies as well as linear routing strategies with finite memory are defined. The state reachability problem in both cases is considered, and the sets of reachable demand vectors are exhibited. The problem of finding optimal routings which minimize network losses subject to demand constraints is formulated as a linear program, and extensions to infinite memory and time-varying systems are given.
4 citations
Patent•
31 Dec 1969
TL;DR: In this paper, the authors propose a routing device that can conveniently and quickly cause door panels, or the like, to be slotted on a mass production basis for purposes of associating hinges therewith that require slots formed in the panels.
Abstract: Routing devices that can conveniently and quickly cause door panels, or the like, to be slotted on a mass production basis for purposes of associating hinges therewith that require slots formed in the panels. The routing tools thereof are held stationary and the panels are fed toward the routing tools.
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
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