Topology control algorithm for IEEE 802.15.4 based single sink wireless sensor networks
01 Dec 2011-pp 1-6
TL;DR: A distributed, multi-point relay based topology control algorithm to construct a Connected Dominating Set (CDS) for the randomly deployed network nodes that restricts the number of active nodes that improves the overall networks energy utilization and extends the network life.
Abstract: IEEE 802154 is a communication standard specifically designed, targeting resource constrained networks IEEE 802154 provides MAC and Physical layer specifications for low power personal area networks like wireless sensor networks IEEE 802154 is designed considering the energy concerns of network devices normally called sensor nodes in wireless sensor networks As per the standard network nodes are categorized as Full Function Device (FFD) nodes or Reduced Function Device (RFD) Here FFD spends more time in active state and consumes more energy while RFD spends more time in sleep state and consumes less energy compared to FFD Objective of topology control mechanism is to reduce the number of active devices without compromising network functionality We have proposed a distributed, multi-point relay based topology control algorithm to construct a Connected Dominating Set (CDS) for the randomly deployed network nodes CDS restricts the number of active nodes that improves the overall networks energy utilization and extends the network life
References
More filters
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Abstract: This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more All chapters are supplemented by thoughtprovoking problems A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering Mathematicians wishing a self-contained introduction need look no further—American Mathematical Monthly 1982 ed
7,221 citations
"Topology control algorithm for IEEE..." refers background in this paper
...Linear Programming and Dynamic Programming are centralized approaches which require information about the entire network at one place which is not feasible for wireless sensor networks....
[...]
...Some of them are based on Dynamic Programming [2], Linear Programming [3], Linear Programming Relaxation [3], Maximum Independent Set (MIS), or Multi-Point Relay (MPR)....
[...]
01 Aug 1999
TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.
Abstract: Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.
1,198 citations
TL;DR: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex.
Abstract: The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex i
1,026 citations
01 Jan 1987
TL;DR: This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.
Abstract: The design of a packet radio network must reflect the operational requirements and environmental constraints to which it is subject. In this paper, we outline those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and we present a design concept for this network that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed network control and frequency hopping spread-spectrum signaling. We demonstrate how the execution of the fully distributed Linked Cluster Algorithm can enable a network to reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code division mutiple access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that exploit CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented in conjunction with the Linked Cluster network structure. The design concept presented in this paper provides a high degree of survivability and flexibility, to accommodate changing environmental conditions and user demands.
943 citations
"Topology control algorithm for IEEE..." refers background in this paper
...first noticed the use of backbone structure in wireless routing and introduced the concept of virtual backbone [1]....
[...]
08 Jun 1997
TL;DR: This paper uses an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone, and maintains local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
Abstract: We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) it is not used primarily for routing packets or flows, but only for computing and updating routes. The primary routes for packets and flows are still computed by a shortest-paths computation; the virtual backbone can, if necessary provide backup routes to handle interim failures. Because of the dynamic nature of the virtual backbone, our approach splits the routing problem into two levels: (a) find and update the virtual backbone, and (b) then find and update routes. The key contribution of this paper is to describe several alternatives for the first part of finding and updating the virtual backbone. To keep the virtual backbone as small as possible we use an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
836 citations
"Topology control algorithm for IEEE..." refers methods in this paper
...For example [12] uses unmarked neighbouring nodes, [9] and [11] use node identity....
[...]