Novel 2-hop coloring algorithm for time-slot assignment of newly deployed sensor nodes without ID in wireless sensor and robot networks

2012 ◽  
Vol 35 (9) ◽  
pp. 1125-1131 ◽  
Author(s):  
Peng Guo ◽  
Tao Jiang ◽  
Kui Zhang
Keyword(s):  
Time Slot ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Slot Assignment ◽  
Robot Networks

scholarly journals A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

2017 ◽  
Vol 2 (4) ◽  
pp. 331 ◽  
Author(s):  
Ilker Bekmezci ◽  
Fatih Alagoz
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Time Slot ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Traffic Pattern ◽  
Assignment Algorithm ◽  
Slot Assignment ◽  
Major Factors

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors inenergy consumption for WSNs is due to communication. Notonly transmission but also reception is the source of energyconsumption. The lore to decrease energy consumption is toturn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper, a new energy efficient and delay sensitive distributed time slot assignment algorithm (DTSM) is proposed for sensor networks under convergecast traffic pattern. DTSM which is developed as part of the military monitory (MILMON) system introduced in [27], aims to operate with low delay and low energy. Instead of collision based periods, it assigns slots by the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, DTSM can assign, if assignment is suitable for convergecast traffic. Simulation results have shown that delay and energy consumption performance of DTSM is superior to FPRP, DRAND, and TRAMA which are the most known distributed slot assignment protocols for WSNs or ad hoc networks. Although DTSM has somewhat long execution time, itsscalability characteristic may provide application specific time durations.

scholarly journals Optimisation-based time slot assignment and synchronisation for TDMA MAC in industrial wireless sensor network

2019 ◽  
Vol 13 (18) ◽  
pp. 2932-2940 ◽  
Author(s):  
Ching-Lung Chang ◽  
Chuan-Yu Chang ◽  
Shuo-Tsung Chen ◽  
Shu-Yi Tu ◽  
Kuan-Yi Ho
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Time Slot ◽  
Wireless Sensor ◽  
Slot Assignment ◽  
Industrial Wireless Sensor Network ◽  
Tdma Mac

Delay Sensitive, Energy Efficient and Fault Tolerant Distributed Slot Assignment Algorithm for Wireless Sensor Networks under Convergecast Data Traffic

2009 ◽  
Vol 5 (5) ◽  
pp. 557-575 ◽  
Author(s):  
Ilker Bekmezci ◽  
Fatih Alagöz
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Time Slot ◽  
Fault Tolerant ◽  
Wireless Sensor ◽  
Delay Sensitive ◽  
Assignment Algorithm ◽  
Slot Assignment

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and the major factor in energy consumption for WSNs is communication. Not only transmission, but also reception is the source of energy consumption. The lore to decrease energy consumption is to turn off the radio circuit when it is not needed. This is why TDMA is advantageous over contention based methods. A time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, a centralized approach is not scalable. In this article, a new energy efficient, delay sensitive, and fault tolerant distributed time slot assignment algorithm, referred to as ft_DTSM, is proposed for sensor networks under convergecast traffic pattern. ft_DTSM aims at operating with low delay and low energy under faulty nodes assumption. Instead of random access based periods, it assigns slots with the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, ft_DTSM can assign, if the assignment is suitable for convergecast traffic. Simulation results have shown that both delay and energy consumption performances of ft_DTSM is superior to existing distributed slot assignment protocols for WSNs. ft_DTSM can also distribute the slots so that the network can continue its operation against a single point of failure. Although ft_DTSM has a somewhat longer execution time, its scalability characteristic may provide application specific time durations.

scholarly journals Hybrid MAC Protocol for UAV-Assisted Wireless Sensor Networks

2018 ◽  
Author(s):  
Muhammad Rusyadi Ramli ◽  
Dong-Seong Kim ◽  
Jae Min Lee
Keyword(s):  
Network Performance ◽  
Time Slot ◽  
Mac Protocol ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Medium Access ◽  
Registration Process ◽  
Beacon Frame ◽  
Transmission Schedule

This paper proposes a hybrid medium access control (MAC) protocol for wireless sensor network (WSN) data gathering, employing unmanned aerial vehicles (UAV). The UAV sends a beacon frame periodically to inform sensor nodes regarding its presence. Afterward, each sensor node which receives beacon frame contends to send registration frame to the UAV. The UAV will transmit the second beacon frame to the registered nodes to notify their transmission schedule. The time-slot scheme is used for the transmission schedule. The transmission schedule of each sensor is determined based on their priority. Specifically, the priority of each sensor is determined during the registration process. Furthermore, the architecture of UAV-WSN data gathering system is introduced in this paper. Simulations are performed, showing that the proposed MAC protocol achieves fairness while enhancing network performance.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document