A constraint programming approach to the additional relay placement problem in wireless sensor networks

Quesada, Luis; Sitanayah, Lanny; Brown, Kenneth N.; O’Sullivan, Barry; Sreenan, Cormac J.

doi:10.1007/s10601-015-9188-8

Cited by 5 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [23], the objective of deploying the relay nodes is to achieve maximum connectivity with minimum cost, thus, weight is defined as the cost of deploying a relay node at a physical location. Quesada, L., et al [24], developed a method of relay node placement for strongly-k-robust wireless sensor network using constrainedt and mixedinteger programming. The proposed solution aims to deploy relay nodes such that k-disjoint paths exist between each sensor node and base station.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Key Player Algorithm-Particle Swarm Optimization (KPA-PSO) for Efficient Relay Nodes Positioning in WSNs

Jain¹,

Vaiyapuri²,

Chaudhary³

2021

DSA

View full text Add to dashboard Cite

Amongst the principal tasks of a sensor node in wireless sensor networks (WSNs) i.e. sensing, processing and communicating, communicating the information to the base station is the most energy expensive. Both direct communication and multi-hop communication between sensor nodes(SNs) and the base station(BS) lead to low network lifetime due to inherent problems within the techniques. Due to this, relay nodes (RNs), more powerful than SNs are deployed within the network to share the transmission load of the SNs and to improve network lifetime. In literature, several methods are proposed to identify the optimum positions for RNs with primary objective to increase network lifetime. Most of the methods have identified the deployment positions in an incremental manner (one after one). In the proposed work, a computationally intelligent solution named as Key Player Algorithm-Particle Swarm Optimization (KPA-PSO) has been developed for identifying the positions to deploy a set of RNs in a two-tiered network model. This method enables selection of a set of optimal number of RN positions to improve connectivity within the network and reduce the energy consumption during data transmission. The novelty of the proposed solution is in using KPP-Positive [1] as objective function for finding set of RN positions, which has been further optimized by using PSO. This approach has been tested for different number of SNs and different field sizes. The proposed method has been compared with State-of-the-Art RN deployment techniques.As per the results, the proposed method has better performance in terms of both connectivity and network lifetime.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In literature several random search based methods have been used for relay node placement. Some of these random search based are presented in [21][22][23][24][25][26][27][28][29][30][31][32]. Evolutionary algorithm has been used by Lanza-Gutiérrez et al, in [21][22] for deployment of fixed number relay nodes in static WSN.…”

Section: Related Workmentioning

confidence: 99%

Key Player Algorithm-Particle Swarm Optimization (KPA-PSO) for Efficient Relay Nodes Positioning in WSNs

Jain¹,

Vaiyapuri²,

Chaudhary³

2021

DSA

View full text Add to dashboard Cite

show abstract

“…Among these approaches, prior researchers have proposed models of WSNs for mining tunnels (mtWSNs) in the form of linear or cylindrical models. [3][4][5][6][7][8][9] The WSNs in tunnels are considered to be linear models, which provide an easier topology to compute the cost of energy consumption. 12,13 In the works by Yang and Xiao 6 and Wu et al, 11 a cylindrical model of mtWSNs is built and adjusts the distance between the RNs to save energy within the whole network.…”

Section: Related Workmentioning

confidence: 99%

“…7 Moreover, many approaches discuss how to deploy the relay nodes (RNs) to improve the lifetime and QoS of WSNs. 8,9 However, few studies have considered organization of the relay layer to improve the performance of the SN layer such that the entire network is improved. The organization is to deploy RNs in order to improve a whole network performance.…”

Section: Introductionmentioning

confidence: 99%

Virtual movement of relay nodes for two-tier wireless sensor networks in tunnels

Zhao

Yuan

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In wireless sensor networks, node placement plays a significant role in terms of meeting design goals, such as cost effectiveness, connectivity, lifetime, and data latency. In tunnel environments, the energy consumption of sensor nodes and relay nodes is imbalanced because of the long and narrow shape of tunnels. In this article, to reduce the use of extra batteries and the number of forwarding times for a message, we propose a new approach to assist in the placement of relay nodes for two-tier wireless sensor networks in a tunnel environment. The approach proposed is based on the principle that working relay nodes can change approximately at the same time during network operation. It seems the relay nodes move to a new place when they are instead by dormant relay nodes. The approach provides a novel method that has been proved to find optimal places to deploy relay nodes in tunnel environment. Moreover, the approach balances the energy consumption of entire sensor nodes and prolongs the lifetime of entire networks significantly, which is shown in simulations.

show abstract

“…Rotar et al [106] use an evolutionary algorithm with a hyperplane (points in space that have better performance than any other individual within the current population). Recent related work also considers the placement of multiple sink and relay nodes [33,100,116]. In Paper II we present an ILP model for an extension of this problem with mobile nodes that solves the problem for large instances, and also finds the exact locations for the minimum number of stationary sensor nodes to be deployed.…”

Section: Optimal Sensor Deployment and Coveragementioning

confidence: 99%

Constraint programming for wireless sensor networks

Bijarbooneh

2015

Constraints

View full text Add to dashboard Cite

In recent years, wireless sensor networks (WSNs) have grown rapidly and have had a substantial impact in many applications. A WSN is a network that consists of interconnected autonomous nodes that monitor physical and environmental conditions, such as temperature, humidity, pollution, etc. If required, nodes in a WSN can perform actions to affect the environment.WSNs present an interesting and challenging field of research due to the distributed nature of the network and the limited resources of the nodes. It is necessary for a node in a WSN to be small to enable easy deployment in an environment and consume as little energy as possible to prolong its battery lifetime. There are many challenges in WSNs, such as programming a large number of nodes, designing communication protocols, achieving energy efficiency, respecting limited bandwidth, and operating with limited memory. WSNs are further constrained due to the deployment of the nodes in indoor and outdoor environments and obstacles in the environment.In this dissertation, we study some of the fundamental optimisation problems related to the programming, coverage, mobility, data collection, and data loss of WSNs, modelled as standalone optimisation problems or as optimisation problems integrated with protocol design. Our proposed solution methods come from various fields of research including constraint programming, integer linear programming, heuristic-based algorithms, and data inference techniques. I would like to say many thanks to Roland Bol and Ivan Christoff for accepting me to MSc studies at Uppsala University, which led to this PhD. Your decision brought me on a very long and joyful journey: without it, I would not have been here today. KeywordsI had the special opportunity to see the ASTRA group on constraint programming grow larger with new PhD students and post-doc fellows throughout my PhD. I enjoyed working at the ASTRA group. Especially my appreciation goes to Jun He, Joseph Scott, Maria Andreina Francisco Rodriguez, and JeanNoël Monette, who always supported me with their thoughts and constructive discussions, and have been great friends for me. I have also always looked forward to your seminars with delicious cakes and cookies. Many thanks to Prof. Christian Schulte, Guido Tack, Mats Carlsson for their discussions and many constructive comments during my seminars and on my publications.I would like to specially thank all members of my PhD parent project (ProFuN). Thank you for your constructive suggestions and discussions during the seminars.I have made many wonderful friends during my PhD, friends who always stood by my side and supported me. There are many names to mention and I wish I could name everyone here, but I believe you know who you are and you know how much I appreciate your precious friendship. Thank you so much for being my friends and helping me to improve. There has been a very difficult time during my PhD when my cat Niuniu had an extremely harsh accident. I must specifically thank Edith Ngai, Palle Raabjerg, Ryoko Asai, and V...

show abstract

A constraint programming approach to the additional relay placement problem in wireless sensor networks

Cited by 5 publications

References 17 publications

Key Player Algorithm-Particle Swarm Optimization (KPA-PSO) for Efficient Relay Nodes Positioning in WSNs

Key Player Algorithm-Particle Swarm Optimization (KPA-PSO) for Efficient Relay Nodes Positioning in WSNs

Virtual movement of relay nodes for two-tier wireless sensor networks in tunnels

Constraint programming for wireless sensor networks

Contact Info

Product

Resources

About