Dynamic sink location update scope control mechanism for mobile sink Wireless Sensor Networks

2011 ◽  
Author(s):  
Y Faheem ◽  
S Boudjit ◽  
K Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Control Mechanism ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Location Update ◽  
Sink Location

Bidirectional Random Walk Based Mobile-Sink-LocationPrivacyin WSN

2014 ◽  
Vol 529 ◽  
pp. 730-734
Author(s):  
Jun Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Random Walk ◽  
Sensor Networks ◽  
Data Collection ◽  
Location Privacy ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Random Data ◽  
Privacy Concerns ◽  
Sink Location

As wide applications of wireless sensor networks, privacy concerns have emerged as the main obstacle to success. When wireless sensor networks are used to battlefield, the privacy about sink-locations become a crux issue. If sink location will be exposed to adversary, the consequence is inconceivable. Random data collection scheme has a problem that message latencies become larger higher for protecting mobile-sink-locationprivacy .In this paper, BDRW (Bidirectional Random Walk) is proposed to preserve mobile-sink-location privacy. In BDRW, data are forwarded by directional random walk and stored at pass nodes in the network, the sink move in directional random walk to collect data from the local nodes occasionally, which prevents the attackers from predicting their locations and movements. Compared to random data collection scheme, BDRW has smaller message latencies, while providing satisfactory mobile-sink-location privacy.

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Sign in / Sign up

Export Citation Format

Share Document