We use cellular automata for simulating topology control algorithms in Wireless Sensor Networks (WSNs). A cellular automaton is a decentralized computing model providing an excellent platform for performing complex co...
详细信息
ISBN:
(纸本)9781467307840
We use cellular automata for simulating topology control algorithms in Wireless Sensor Networks (WSNs). A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computations using only local information. WSNs are composed of a large number of distributed sensor nodes operating on batteries;the objective of the topologycontrol problem in WSNs is to select an appropriate subset of nodes able to monitor a region at a minimum energy consumption cost thus extending the network lifetime. We have used cellular automata to model a randomized WSN topologycontrol algorithm and have experimentally evaluated its performance.
Broadcasting is a fundamental task, being used for neighboring discovery in various medium access control and routing protocols. This paper presents a comparative analysis of various broadcast techniques and topology ...
详细信息
ISBN:
(纸本)9780769548937;9781467346245
Broadcasting is a fundamental task, being used for neighboring discovery in various medium access control and routing protocols. This paper presents a comparative analysis of various broadcast techniques and topologycontrol mechanisms. Overall, nine topologycontrol mechanisms and seven broadcast protocols are combined, generating sixty-three possible solutions. Among the broadcast algorithms studied, two are proposed in this paper: the Record Route Elimination (RRE) and Record Route Elimination with Distance Prediction (RRE-DP). The simulation results show that the RRE and RRE-DP allow for a significant reduction in energy consumption, regardless of the topologycontrol mechanism associated.
The main goal of a topologycontrol scheme in wireless sensor networks is to reduce node power consumption in order to extend network lifetime. In this paper we present an overview of a range of topologycontrol algor...
详细信息
The main goal of a topologycontrol scheme in wireless sensor networks is to reduce node power consumption in order to extend network lifetime. In this paper we present an overview of a range of topology control algorithms proposed in literature for wireless sensor networks. The topologycontrol schemes in most of the existing works can be categorized into two classes: Either multi-state or power-control. We believe that most energy savings might come from turning off redundant nodes rather than by minimizing node transmit power. However, both classes of schemes could be combined for further energy savings. Each algorithm is described in depth and compared against each other to capture their uniqueness. The most important design issues of topologycontrol are also highlighted.
topologycontrol problems are associated with assignment of power levels to nodes of a wireless network so that the resulting graph topology satisfies certain properties. In this paper we consider the problem of power...
详细信息
topologycontrol problems are associated with assignment of power levels to nodes of a wireless network so that the resulting graph topology satisfies certain properties. In this paper we consider the problem of power-efficient topologycontrol with switched beam directional antennas taking into account their non-uniform radiation pattern within the beam-width. Previous work in the area have all assumed a uniform gain model with these antennas which renders antenna orientation insignificant as a parameter in topology control algorithms. We present algorithms that take into account a model of non-uniform gain with the objectives of minimizing the total power and maximum power to keep the network connected. We consider two cases: one where the antenna orientation is assumed given and another where the antenna orientation needs to be derived as well. For the first case, we present optimal and approximation algorithms for constructing power-efficient topologies. For the second case, we prove the problem to be NP-complete and present heuristic solutions along with approximation bounds. Through comparison of the two cases by simulation, significant reductions are shown in the maximum as well as total power required to keep the network connected for the second case, thus demonstrating the benefits of using antenna orientation as parameter in topology construction. (C) 2007 Elsevier B.V. All rights reserved.
暂无评论