Simulating Large Wireless Sensor Networks Using Cellular Automata

Cunha, Renan O.; Silva, Aloizio P.; Loureiro, Antônio A. F.; Ruiz, Linnyer B.

doi:10.1109/anss.2005.40

Cited by 49 publications

(35 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Authors in [137] have taken this direction and have developed SO channel assignment schemes using cellular automata theory. Since SO systems in nature also have similar operational principles to CA, so we can infer that CA is one of the most natural approaches towards designing SO [138]. The two main challenges in the feasibility of deploying CA based solutions are the system convergence and determination of the exact system response to irrational changes in environment.…”

Section: ) Cellular Automatamentioning

confidence: 99%

A Survey of Self Organisation in Future Cellular Networks

Aliu

Imran

et al. 2013

IEEE Commun. Surv. Tutorials

379

217

View full text Add to dashboard Cite

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks.

show abstract

Section: ) Cellular Automatamentioning

confidence: 99%

A Survey of Self Organisation in Future Cellular Networks

Aliu

Imran

et al. 2013

IEEE Commun. Surv. Tutorials

379

217

View full text Add to dashboard Cite

show abstract

“…Therefore, active and idle states imply that the sensor node is alive. Initially, each node has 0.8 units of energy; energy consumption is assumed to be 0.0165 units/step for active nodes and 0.00006 units/step for idle nodes [20,34]. A sensor node turns off when it runs out of energy.…”

Section: Topology Control Algorithmsmentioning

confidence: 99%

“…In this work, we focus on a subset of topology control algorithms (duty cycling and scheduling while maintaining connectivity and coverage) and use the cellular automata simulation approach suggested in [20] in order to experimentally investigate which type of neighbourhood should be preferred for obtaining efficient simulations for topology control algorithms in WSN. Existing implementations of cellular automata have been developed using Java and C/C++, Matlab or C-based special-purpose simulating tools like COOJA, OMNeT++, Casim tool that require advanced programming skills on behalf of the user/developer.…”

Section: Introductionmentioning

confidence: 99%

“…Other applications of CA include the simulation of natural phenomena [14,15], urban growth [16], behavior of a population in a certain situation [17] etc. Cellular automata have successfully been used as a means for modeling and simulation of topology control algorithms in Wireless Sensor Networks (WSNs) [18][19][20][21][22][23]. A WSN is a special kind of network composed of a large number of autonomous sensor nodes geographically scattered on a surface with the ability to monitor an area inside their range and collect data about physical and environmental conditions such as temperature, sound, vibration, pressure, motion or pollutants.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simulation of Topology Control Algorithms in Wireless Sensor Networks Using Cellular Automata

Athanassopoulos¹,

Kaklamanis²,

Kalfountzos³

et al. 2013

IJCNS

View full text Add to dashboard Cite

We use cellular automata for simulating a series of topology control algorithms in Wireless Sensor Networks (WSNs) using various programming environments. 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 wireless sensor nodes operating on batteries. The objective of the topology control problem in WSNs is to select an appropriate subset of nodes able to monitor a region at a minimum energy consumption cost and, therefore, extend network lifetime. Herein, we present topology control algorithms based on the selection-in a deterministic or randomized way-of an appropriate subset of sensor nodes that must remain active. We use cellular automata for conducting simulations in order to evaluate the performance of these algorithms and investigate the effect/role of the neighbourhood selection in the efficient application of our algorithms. Furthermore, we implement our simulations in Matlab, Java and Python in order to investigate in which ways the selection of an appropriate programming environment can facilitate experimentation and can result in more efficient application of our algorithms.

show abstract

“…최근에 무선 센서 네 트워크의 에너지 효율 및 확장성의 실현을 위해 간단 한 셀룰러 오토마타 (cellular automata (CA)) 구조가 많은 관심을 받고 있다 [7][8][9][10][11][12][13][14][15][16][17][18][19] . CA에 있어서 각각의 셀 은 그 자신의 상태를 자동으로 결정하며 다른 이웃 셀 들의 상태를 다시 입력으로 받아들이는 오토마타로서 작동한다 [7]- [10] .…”

unclassified

Cellular-Automata Based Node Scheduling Scheme for Wireless Sensor Networks

Byun

Shon

2014

The Journal of Korean Institute of Communications and Informati

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

show abstract

Simulating Large Wireless Sensor Networks Using Cellular Automata

Cited by 49 publications

References 12 publications

A Survey of Self Organisation in Future Cellular Networks

A Survey of Self Organisation in Future Cellular Networks

Simulation of Topology Control Algorithms in Wireless Sensor Networks Using Cellular Automata

Cellular-Automata Based Node Scheduling Scheme for Wireless Sensor Networks

Contact Info

Product

Resources

About