A probabilistic location estimated algorithm for Wireless Sensor ...
Recommend Documents
In this section, we describe our distributed location esti- mation (DLE) .... circle and (h, k) is the coordinate of the center of the circle. Therefore ... To solve equations 1 and 2, we derive the equation of the line which .... point of the lower
a message, it sends an acknowledgment to the sender. The unreliable radio ..... selects messages that provide the greatest improvement. It should be noticed ...
inferring the room location of a device such as a laptop or PDA in a wireless ..... Laboratory has constructed a small, inexpensive sensor board that can ...
for increasing the lifetime of a wireless sensor network. One of the main advantages of these networks, leading to a longer lifetime, is the ability of data ...
Jan 23, 2017 - 3Information and Communications Technology, Singapore Institute of .... Because recent studies [7] [8] show that wireless links can be highly.
covered/detected with probability 1. Our work differ from this approach in that our main assumption is that sensing capabilities in all directions is always ...
Their wide range of applications is based on the possible use of various sensor .... sensors in a lattice structure to monitor in a rather homogenous and uniform way ... (iii) It knows the direction towards the sink S. This can be implemented during
Keywords: Network Lifetime, Wireless sensor networks, Routing chain, Genetic Algorithm, Simulated ... thus becomes an important metric for efï¬ciency of a.
[3] Gu, Yu, Yusheng Ji, Jie Li, Biao Han, and Baohua Zhao. "Delay-bounded ... [4] JKim, Jae-Wan, Jeong-Sik In, Kyeong Hur, Jin-Woo Kim, and Doo-Seop Eom.
Springer Science+Business Media, LLC 2010. Abstract Wireless sensor networks (WSNs) are an emerg- ing technology for monitoring physical world. Different ...
node has two unconnected neighbours, it declares itself as gateway. ..... By restricting the set N2(v) to include only root nodes, DMAC generates one-hop ...
May 27, 2009 - void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance ... that intermediate nodes can learn the packet's destination.
May 31, 2012 - The limited supply of power and other constraints, such ..... it uses the Metropolis-Hastings kernel (8). Hence, by the ..... Base station. Tier-1.
Oct 11, 2010 - wireless sensor networks aim to find an efficient way to compress data for reducing node ... Lin and Vana proposed an online information.
ECDSA (elliptic curve digital signature algorithm). ... authors have designed a strong and efficient scheme against node
of positions for guards or cameras so that every point in a gallery is observed by at least .... We call this algorithm Distributed Self-Spreading Algorithm(DSSA).
Beyond periodic retransmission, assignment to a shared variable causes peremptory ...... Next century challenges: mobile networking for âsmart dustâ. In.
In this section we briefly present the basic characteristics of the. GA-based optimal design algorithm originally developed in Feren- tinos and Tsiligiridis [8].
Dec 19, 2013 - Received: 25 October 2013; in revised form: 5 December 2013 / Accepted: 17 .... data aggregation and the tour length of the mobile collector. ..... (12). Equation (13) requires that only the neighboring sensor node affiliated with ...
solving the problems encountered when developing location-aware and ... Key words: Location estimation, probabilistic modeling, wireless networks. 1.
A Range-Free Localization Algorithm for Wireless Sensor. Networks .... similar to a routing table (we call it 'anchor table') to keep information about anchor ..... Conference of the IEEE Computer and Communications Societies. IEEE,. 2003, pp.
Wireless sensor networking has become an area of intense research activity. This is due to ... since they can patrol a wide area, and they can be re-positioned for better surveillance [7]. .... iterative multilateration [17]. This locationing ability
probabilistic approach, suitable for outdoor systems with inaccurate range ... power sensors and microcontrollers enable a new wide ... Multilateration [9] (an.
A probabilistic location estimated algorithm for Wireless Sensor ...
Recovery in Wireless Sensor Networks. Prasan Kumar ... Recovery of coverage holes by increasing power level ... sensing disc of a source node (S) with sensing disc of its connecting .... Run about 100 rounds to get the average of the data.
Vector Method based Coverage Hole Recovery in Wireless Sensor Networks
Prasan Kumar Sahoo JangZern Tsai HongLin Ke
Outline • Introduction • Problem Formulation – Definition – Boundary gap algorithm
Introduction In WSN, nodes are deployed randomly. Accidental death of the nodes OR Death due to power exhaustion may disturb the existing coverage and connectivity of the network. Coverage and Connectivity maintenance is highly essential in WSNs.
Motivations Coverage problem is a major research issue in WSNs. Recovery of coverage holes by increasing power level OR mobility of nodes to longer distance
May increase coverage overlapping Longer mobility distance or higher power level consume more energy. Not suitable for energy constraint WSN
Goals Recover coverage holes, using
mobility of nodes, But, mobility is limited within 1 hop only. After mobility, initial kcoverage of each mobile node is not increased.
Problem Formulation • Sensors are distributed randomly and densely • Each node is aware of its own location and coordinates of the boundary of the deployed region • Communication range (Rc)=2*sensing range (Rs). • At the time of deployment, multiple coverage holes are present in the network.
Definitions • CLOSE HOLE: If a coverage hole is completely enclosed by the sensing disc of the sensors. • OPEN HOLE: If a coverage hole is enclosed by the boundary of the monitoring region and sensing discs of the sensors
n2
n1
H2
n7
H3
H5 n8
n3 H1
n6
n10
n4
n5
n9
H5 n16
H5 n11
n12
H4 n15 H5
n14
H5
n17 n18
n13 H5
n19
Definitions • • • •
CLOSEWORKER and COWORKER: For any two nodes Si and Sj, if 0 π, it cannot move; • Step 7: Go to Step I to select another node as source node; • Step 8: Find the resultant vector VR of S; • Direction of VR is the direction of mobility of S; • Step 9: Find the mobility distance D; • Step 10: Continue the procedure until all nodes are visited;
Simulation Setups • • • • • •
Simulated using Ns2.33. Deployed node #: 200 ~ 1200. Area: 500m × 500m. TwoRayGround propagation model Run about 100 rounds to get the average of the data. IEEE 802.15.4 MAC is considered for the channel access mechanism. • Energy consumption due to mobility cost of each sensor is taken 8.267J/m. • Sensing range varies from 15m to 30m, Rc = 2Rs.
Results
Conclusions • We propose distributed algorithms to recover the holes • Use laws of vectors as the tool to decide the magnitude and direction of the mobile nodes. • Mobility of nodes in our protocol is limited within only onehop. • Our algorithms can recover coverage holes of irregular shapes without increasing the highest coverage of the mobile nodes.
