Communication Reliability Support with the Minimum Number of Totally Transmitted Packets in Wireless Sensor Networks

2012 ◽  
Vol E95.B (7) ◽  
pp. 2455-2458
Author(s):  
Sungkee NOH ◽  
Euisin LEE ◽  
Soochang PARK ◽  
Seungmin OH ◽  
Sang-Ha KIM
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Number ◽  
Communication Reliability

Obstacle mapping in wireless sensor networks via minimum number of measurements

2016 ◽  
Vol 10 (3) ◽  
pp. 237-246 ◽  
Author(s):  
Amirafshar Moshtaghpour ◽  
Mohammad Ali Akhaee ◽  
Masoud Attarifar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Minimum Number

scholarly journals Performance Evaluation of Wireless Sensor Networks for Event-Detection with Shadowing-Induced Radio Irregularities

2007 ◽  
Vol 3 (3-4) ◽  
pp. 251-266
Author(s):  
Giuseppe De Marco ◽  
Tao Yang ◽  
Makoto Ikeda ◽  
Leonard Barolli
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Event Detection ◽  
Radio Signal ◽  
Previous Analysis ◽  
Radio Channel ◽  
Wireless Sensor ◽  
Detection And Tracking ◽  
Minimum Number ◽  
The Subject

In this paper, we study a particular application of wireless sensor networks for event-detection and tracking. In this kind of application, the transport of data is simplified, and guaranteeing a minimum number of packets at the monitoring node is the only constraint on the performance of the sensor network. This minimum number of packets is called event-reliability. Contrary to other studies on the subject, here we consider the behavior of such a network in presence of a realistic radio model, such as the shadowing of the radio signal. With this setting, we extend our previous analysis of the event-reliability approach for the transport of data. In particular, both regular and random networks are considered. The contribute of this work is to show via simulations that, in the presence of randomness or irregularities in the radio channel, the event-reliability can be jeopardized, that is the constraint on the minimum number of packets at the sink node could not be satisfied.

scholarly journals Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 376 ◽  
Author(s):  
Gulshan Kumar ◽  
Rahul Saha ◽  
Mritunjay Rai ◽  
Reji Thomas ◽  
Tai-Hoon Kim ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Estimation Error ◽  
Dominating Set ◽  
Connected Dominating Set ◽  
Location Estimation ◽  
Wireless Sensor ◽  
Minimum Number ◽  
Anchor Nodes

Location estimation in wireless sensor networks (WSNs) has received tremendous attention in recent times. Improved technology and efficient algorithms systematically empower WSNs with precise location identification. However, while algorithms are efficient in improving the location estimation error, the factor of the network lifetime has not been researched thoroughly. In addition, algorithms are not optimized in balancing the load among nodes, which reduces the overall network lifetime. In this paper, we have proposed an algorithm that balances the load of computation for location estimation among the anchor nodes. We have used vector-based swarm optimization on the connected dominating set (CDS), consisting of anchor nodes for that purpose. In this algorithm, major tasks are performed by the base station with a minimum number of messages exchanged by anchor nodes and unknown nodes. The simulation results showed that the proposed algorithm significantly improves the network lifetime and reduces the location estimation error. Furthermore, the proposed optimized CDS is capable of providing a global optimum solution with a minimum number of iterations.

Data Gathering With Minimum Number of Relay Packets in Wireless Sensor Networks

2017 ◽  
Vol 17 (21) ◽  
pp. 7196-7208 ◽  
Author(s):  
Chien-Fu Cheng ◽  
Lung-Hao Li ◽  
Chen-Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Wireless Sensor ◽  
Minimum Number

scholarly journals A Novel Deployment Scheme Based on Three-Dimensional Coverage Model for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fu Xiao ◽  
Yang Yang ◽  
Ruchuan Wang ◽  
Lijuan Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computing Power ◽  
Deployment Strategy ◽  
Coverage Model ◽  
Minimum Number ◽  
Random Method

Coverage pattern and deployment strategy are directly related to the optimum allocation of limited resources for wireless sensor networks, such as energy of nodes, communication bandwidth, and computing power, and quality improvement is largely determined by these for wireless sensor networks. A three-dimensional coverage pattern and deployment scheme are proposed in this paper. Firstly, by analyzing the regular polyhedron models in three-dimensional scene, a coverage pattern based on cuboids is proposed, and then relationship between coverage and sensor nodes’ radius is deduced; also the minimum number of sensor nodes to maintain network area’s full coverage is calculated. At last, sensor nodes are deployed according to the coverage pattern after the monitor area is subdivided into finite 3D grid. Experimental results show that, compared with traditional random method, sensor nodes number is reduced effectively while coverage rate of monitor area is ensured using our coverage pattern and deterministic deployment scheme.

Sign in / Sign up

Export Citation Format

Share Document