A Modified Method for Constructing Minimum Size Homogeneous Wireless Sensor Networks with Relay Nodes to Fully Cover Critical Square Grids

2014 ◽  
pp. 213-220 ◽  
Author(s):  
Bing-Hong Liu ◽  
Yue-Xian Lin ◽  
Wei-Sheng Wang ◽  
Chih-Yuan Lien
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Size ◽  
Relay Nodes ◽  
Modified Method

scholarly journals A DISTRIBUTED ENERGY EFFICIENT CLUSTERING ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 19 (1) ◽  
pp. 72-90
Author(s):  
Seyed Mohammad Bagher Musavi Shirazi ◽  
Maryam Sabet ◽  
Mohammad Reza Pajoohan
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Clustering Algorithm ◽  
Base Station ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Cluster Heads ◽  
Energy Efficient Clustering

Wireless sensor networks (WSNs) are a new generation of networks typically consisting of a large number of inexpensive nodes with wireless communications. The main purpose of these networks is to collect information from the environment for further processing. Nodes in the network have been equipped with limited battery lifetime, so energy saving is one of the major issues in WSNs. If we balance the load among cluster heads and prevent having an extra load on just a few nodes in the network, we can reach longer network lifetime. One solution to control energy consumption and balance the load among nodes is to use clustering techniques. In this paper, we propose a new distributed energy-efficient clustering algorithm for data aggregation in wireless sensor networks, called Distributed Clustering for Data Aggregation (DCDA). In our new approach, an optimal transmission tree is constructed among sensor nodes with a new greedy method. Base station (BS) is the root, cluster heads (CHs) and relay nodes are intermediate nodes, and other nodes (cluster member nodes) are the leaves of this transmission tree. DCDA balances load among CHs in intra-cluster and inter-cluster data communications using different cluster sizes. For efficient inter-cluster communications, some relay nodes will transfer data between CHs. Energy consumption, distance to the base station, and cluster heads’ centric metric are three main adjustment parameters for the cluster heads election. Simulation results show that the proposed protocol leads to the reduction of individual sensor nodes’ energy consumption and prolongs network lifetime, in comparison with other known methods. ABSTRAK: Rangkaian sensor wayarles (WSN) adalah rangkaian generasi baru yang terdiri daripada nod-nod murah komunikasi wayarles. Tujuan rangkaian-rangkaian ini adalah bagi mengumpul maklumat sekeliling untuk proses seterusnya. Nod dalam rangkaian ini dilengkapi bateri kurang jangka hayat, jadi simpanan tenaga adalah satu isu besar dalam WSN. Jika beban diimbang antara induk kelompok dan lebihan beban dihalang pada setiap rangkaian iaitu hanya sebilangan kecil nod pada tiap-tiap kelompok,  jangka hayat dapat dipanjangkan pada sesebuah rangkaian. Satu penyelesaian adalah dengan mengawal penggunaan tenaga dan mengimbangi beban antara nod menggunakan teknik berkelompok. Kajian ini mencadangkan kaedah baru pembahagian tenaga berkesan secara algoritma berkelompok bagi pembahagian data dalam WSN, dikenali sebagai Pembahagian Kelompok Kumpulan Data (DCDA). Melalui pendekatan baru ini, pokok transmisi optimum dibina antara nod sensor melalui kaedah baru. Stesen utama (BS) ialah akar, induk kelompok-kelompok (CHs) dan nod penyiar ialah nod perantara, dan nod-nod lain (nod-nod ahli kelompok) ialah daun bagi pokok trasmisi. DCDA mengimbangi beban CHs antara-kelompok dan dalam-kelompok komunikasi data daripada kelompok berbeza saiz. Bagi komunikasi berkesan dalam-kelompok, sebahagian nod penyampai akan memindahkan data antara CHs. Penggunaan tenaga, jarak ke stesen utama dan induk kelompok metrik sentrik adalah tiga parameter pelaras bagi pemilihan induk kelompok. Keputusan simulasi protokol yang dicadang menunjukkan pengurangan penggunaan tenaga pada nod-nod sensor individu dan memanjangkan jangka hayat rangkaian, berbanding kaedah-kaedah lain yang diketahui.

scholarly journals A Novel Cooperative ARQ Method for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Haiyong Wang ◽  
Geng Yang ◽  
Yiran Gu ◽  
Jian Xu ◽  
Zhixin Sun
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Markov Chain Model ◽  
Relay Node ◽  
Wireless Sensor ◽  
System Throughput ◽  
Chain Model ◽  
Channel Fading ◽  
Relay Nodes

In wireless sensor networks, cooperative communication can combat the effects of channel fading by exploiting diversity gain achieved via cooperation communication among the relay nodes. A cooperative automatic retransmission request (ARQ) protocol based on two-relay node selection was proposed in this paper. A novel discrete time Markov chain model in order to analyze the throughput and energy efficiency was built, and system throughput and energy efficiency performance of proposed protocol and traditional ARQ protocol were studied based on such model. The numerical results reveal that the throughput and energy efficiency of the proposed protocol could perform better when compared with the traditional ARQ protocol.

scholarly journals RELAY DEPLOYMENT ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY

2018 ◽  
Vol 14 (2) ◽  
pp. 131-137
Author(s):  
Lanny Sitanayah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Fault Tolerant ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Alternate Routes ◽  
Relay Deployment

Wireless Sensor Networks (WSNs) are subject to failures. Even though reliable routing protocols for WSNs exist and are well-understood, the physical network topology must ensure that alternate routes with an acceptable length to the sinksare in fact available when failures occur. This requires a sensor network deployment to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures do occur the protocols can continue to offer reliable delivery. To ensure that sensor nodes have sufficient paths, it may be necessary to add a number of additional relay nodes, which do not sense, but only forward data from other nodes. In this paper, we review a range of existing algorithms to deploy relay nodes for fault tolerance. We classify the state-of-the-art relay placement algorithms based on routing structures, connectivity requirements, deployment locations, and fault-tolerant requirements.

scholarly journals A Novel Synchronous MAC Protocol for Wireless Sensor Networks with Performance Analysis

Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5394 ◽  
Author(s):  
Prasan Kumar Sahoo ◽  
Sudhir Ranjan Pattanaik ◽  
Shih-Lin Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Mac Protocol ◽  
Wireless Sensor ◽  
Medium Access ◽  
Relay Nodes ◽  
Healthcare Applications ◽  
Mesh Topology ◽  
Free Data

Synchronous medium access control (MAC) protocols are highly essential for wireless sensor networks (WSN) to support transmissions with energy saving, quality services, and throughput in industrial, commercial and healthcare applications. In this paper, a synchronous channel access mechanism is designed, where sensors can reserve the contention free data transmission slots in different available channels. To reduce the delay of data transmission among the nodes in the mesh topology, a linear programming problem (LPP) model is designed to select suitable relay nodes. Moreover, the performance of the proposed MAC is analyzed and our models are validated with simulation and analytical results. The results show that our proposed MAC protocol outperforms the IEEE 802.15.4e MAC mechanism in terms of throughput, reliability, delay, energy, packet drop rate and transmission success rate.

Sign in / Sign up

Export Citation Format

Share Document