Adaptive Coupling Model of Time Synchronization and Topology Control in Large-Scale Wireless Sensor Networks

2018 ◽  
Author(s):  
Zhaobin Liu ◽  
Wenzhi Liu ◽  
Qiang Ma ◽  
Gang Liu ◽  
Ligang Fang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Large Scale ◽  
Time Synchronization ◽  
Coupling Model ◽  
Wireless Sensor ◽  
And Topology ◽  
Adaptive Coupling

Snowball Effect Time Synchronization Based on Energy Optimization for Wireless Sensor Networks

2012 ◽  
Vol 263-266 ◽  
pp. 866-871
Author(s):  
Gang Yang ◽  
Ming Fei Liang ◽  
Tian Tian Xu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Time Synchronization ◽  
Energy Optimization ◽  
Wireless Sensor ◽  
Synchronization Algorithm ◽  
Message Exchange ◽  
Effect Time ◽  
Snowball Effect

In large scale of WSNs (wireless sensor networks), a centralized algorithm is not suitable for WSNs. Distributed algorithm has the obvious advantage over traditional time synchronization algorithm. The paper proposes a distributed time synchronization algorithm for WSNs, called SNOWBALL effect time synchronization. In the algorithm, a node needs only to communicate with its neighbor node, synchronizing itself clock based on the neighbor nodes information. The algorithm is a continuous synchronization process. The network will reach balance and clock consistency after repeated algorithm iterations. In the algorithm, we achieve network energy optimization by reducing unnecessary message exchange.

scholarly journals Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints

2010 ◽  
pp. 184-208 ◽  
Author(s):  
Qiang-Sheng Hua ◽  
Francis Lau
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Link Scheduling ◽  
Wireless Links ◽  
And Topology ◽  
Data Gathering Tree

This chapter studies the joint link scheduling and topology control problems in wireless sensor networks. Given arbitrarily located sensor nodes on a plane, the task is to schedule all the wireless links (each representing a wireless transmission) between adjacent sensors using a minimum number of timeslots. There are two requirements for these problems: first, all the links must satisfy a certain property, such as that the wireless links form a data gathering tree towards the sink node; second, all the links simultaneously scheduled in the same timeslot must satisfy the SINR constraints. This chapter focuses on various scheduling algorithms for both arbitrarily constructed link topologies and the data gathering tree topology. We also discuss possible research directions.

scholarly journals Topology Control and Routing in Large Scale Wireless Sensor Networks

2010 ◽  
Vol 02 (08) ◽  
pp. 584-598 ◽  
Author(s):  
Ines Slama ◽  
Badii Jouaber ◽  
Djamal Zeghlache
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Topology Control ◽  
Large Scale ◽  
Wireless Sensor
Sign in / Sign up

Export Citation Format

Share Document