Data Traffic Modeling of ML-MAC for Wireless Sensor Networks

2018 ◽  
pp. 347-356
Author(s):  
Aarti Kochhar ◽  
Pardeep Kaur ◽  
Preeti
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Traffic Modeling ◽  
Data Traffic

Research on Data Aggregation Algorithms Based on OPT in Wireless Sensor Networks

2013 ◽  
Vol 427-429 ◽  
pp. 1991-1994
Author(s):  
Xue Wen He ◽  
Le Ping Zheng ◽  
Kuan Gang Fan ◽  
Sun Han ◽  
Qing Mei Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Measurement Accuracy ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Fusion Model ◽  
Design Goal ◽  
Improve Measurement ◽  
Battery Energy

Since wireless sensor networks consist of sensors with limited battery energy, a major design goal is to maximize the lifetime of sensor network. To improve measurement accuracy and prolong network lifetime, reducing data traffic is needed. In the clustering-based wireless sensor networks, a novel data aggregation algorithm based on OPT and Layida Method is proposed. In the proposed method, Layida Method preprocesses data and data fusion model for data integration are used. Its availability is proved by comparing with the results of two existing algorithms.

Wireless sensor networks for intrusion detection: packet traffic modeling

2006 ◽  
Vol 10 (1) ◽  
pp. 22-24 ◽  
Author(s):  
I. Demirkol ◽  
F. Alagoz ◽  
H. Delic ◽  
C. Ersoy
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Wireless Sensor ◽  
Traffic Modeling

A Spatial Correlation Based Data Aggregation Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 655-657 ◽  
pp. 655-659 ◽  
Author(s):  
Lei Chun Wang ◽  
Guo Yu Zhou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spatial Correlation ◽  
Data Aggregation ◽  
Wireless Sensor ◽  
Data Detection ◽  
Data Traffic ◽  
Quality Of Data ◽  
Energy Consumption Rate

Data aggregation is the important method to reduce data traffic and lower energy expenditure in wireless sensor networks (WSN). This paper analyzes the characteristics of data sampled by nodes, and gives the method to decide spatial correlation between neighboring nodes and the criteria to classify and decide data in WSN. On the basis of this, this paper proposes a spatial correlation based data aggregation algorithm for WSN, SCBD. SCBD classifies and decides data according to data criteria and spatial correlation among nodes in normal nodes and cluster heads at the same time, and then aggregates different types of data. The results show that SCBD outperforms RAA in terms of energy consumption, rate of data detection and quality of data aggregation.

scholarly journals Enhancing SDN WISE with Slicing Over TSCH

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1075
Author(s):  
Federico Orozco-Santos ◽  
Víctor Sempere-Payá ◽  
Teresa Albero-Albero ◽  
Javier Silvestre-Blanes
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Control Level ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Data Traffic ◽  
Medium Access ◽  
Industrial Wireless Sensor Networks ◽  
Channel Hopping ◽  
Industrial Level

IWSNs (Industrial Wireless Sensor Networks) have become the next step in the evolution of WSN (Wireless Sensor Networks) due to the nature and demands of modern industry. With this type of network, flexible and scalable architectures can be created that simultaneously support traffic sources with different characteristics. Due to the great diversity of application scenarios, there is a need to implement additional capabilities that can guarantee an adequate level of reliability and that can adapt to the dynamic behavior of the applications in use. The use of SDNs (Software Defined Networks) extends the possibilities of control over the network and enables its deployment at an industrial level. The signaling traffic exchanged between nodes and controller is heavy and must occupy the same channel as the data traffic. This difficulty can be overcome with the segmentation of the traffic into flows, and correct scheduling at the MAC (Medium Access Control) level, known as slices. This article proposes the integration in the SDN controller of a traffic manager, a routing process in charge of assigning different routes according to the different flows, as well as the introduction of the Time Slotted Channel Hopping (TSCH) Scheduler. In addition, the TSCH (Time Slotted Channel Hopping) is incorporated in the SDN-WISE framework (Software Defined Networking solution for Wireless Sensor Networks), and this protocol has been modified to send the TSCH schedule. These elements are jointly responsible for scheduling and segmenting the traffic that will be sent to the nodes through a single packet from the controller and its performance has been evaluated through simulation and a testbed. The results obtained show how flexibility, adaptability, and determinism increase thanks to the joint use of the routing process and the TSCH Scheduler, which makes it possible to create a slicing by flows, which have different quality of service requirements. This in turn helps guarantee their QoS characteristics, increase the PDR (Packet Delivery Ratio) for the flow with the highest priority, maintain the DMR (Deadline Miss Ratio), and increase the network lifetime.

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

2011 ◽  
Vol 1 (3) ◽  
pp. 49-70 ◽  
Author(s):  
Martin Brandl ◽  
Andreas Kos ◽  
Karlheinz Kellner ◽  
Christian Mayerhofer ◽  
Thomas Posnicek ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Data Forwarding ◽  
On Demand ◽  
Dynamic Source ◽  
Demand Routing ◽  
Set Up

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

2013 ◽  
pp. 218-240
Author(s):  
Martin Brandl ◽  
Andreas Kos ◽  
Karlheinz Kellner ◽  
Christian Mayerhofer ◽  
Thomas Posnicek ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Data Forwarding ◽  
On Demand ◽  
Dynamic Source ◽  
Demand Routing ◽  
Set Up

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Sign in / Sign up

Export Citation Format

Share Document