scholarly journals A Study of BLE Mesh Network Scheduling Algorithm Using A Smartplug

2021 ◽  
Vol 12 (6) ◽  
pp. 456-451
Author(s):  
Goo Kim Et.al
Keyword(s):  
Collision Avoidance ◽  
Scheduling Algorithm ◽  
Data Communication ◽  
Mesh Network ◽  
Sleep Mode ◽  
Network Scheduling ◽  
Simple Method ◽  
Transmission Success ◽  
Success Ratio ◽  
Data Length

This paper proposes a BLE Mesh network scheduling algorithm using SmartPlug. And proposes random-backoff, a very simple method for collision avoidance. The low-energy scheduling algorithm of SmartPlug and BLE node is proposed. SmartPlug periodically broadcasts its own information to inform the surrounding BLE nodes and SmartPlug. A node for data communication with SmartPlug is decided for efficiency. The BLE node periodically transmits data and switches to sleep mode after data transmission. In this paper, propose a very simple method, random-backoff, to reduce collisions when transmitting data in a BLE node. In the simulation of results shows when the data size is 1 ~ 31 bytes and 32 ~ 255 bytes, and random-backoff is effective when 1~31 bytes length. In the case of 32 to 255 bytes, random-backoff is not effective, so additional research is needed. And the simulation conducts under the same condition, but it shows that the data length and the number of transmission attempts has an effect. The simulation results show the transmission success ratio is similar regardless of the data length when random-backoff is not applied. It also shows the number of transmission attempts has an effect. Also, this simulation shows the results that as the number of nodes increases, the wireless environment becomes congested, and the transmission success ratio decreases. As a result of the simulation, random-backoff for collision avoidance is effective in transmitting data of 1 to 31 bytes better than 32 to 255 bytes in the data length.

COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK

2012 ◽  
Vol 3 (3) ◽  
pp. 368-374
Author(s):  
Usha Kumari ◽  
Udai Shankar
Keyword(s):  
Network Performance ◽  
Mesh Networks ◽  
Mac Protocol ◽  
Scheduling Algorithm ◽  
Ieee 802.16 ◽  
Distributed Scheduling ◽  
Mesh Network ◽  
Fourth Generation ◽  
Network Nodes ◽  
Wireless Mesh

IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive Applications. According to IEEE 802.16 MAC protocol, there are three scheduling algorithms for assigning TDMA slots to each network node: centralized and distributed the distributed is further divided into two operational modes coordinated distributed and uncoordinated distributed. In coordinated distributed scheduling algorithm, network nodes have to transmit scheduling message in order to inform other nodes about their transfer schedule. In this paper a new approach is proposed to improve coordinated distributed scheduling efficiency in IEEE 802.16 mesh mode, with respect to three parameter Throughput, Average end to end delay and Normalized Overhead. For evaluating the proposed networks efficiency, several extensive simulations are performed in various network configurations and the most important system parameters which affect the network performance are analyzed

Priority Scheduling Algorithm for Traffic in a LTE-based Defence Mesh Network Incorporating Centralised Scheduling Architecture

2017 ◽  
Vol 67 (5) ◽  
pp. 581
Author(s):  
Sidharth Shukla ◽  
Vimal Bhatia
Keyword(s):  
Packet Loss ◽  
Mesh Networks ◽  
Scheduling Algorithm ◽  
Data Rate ◽  
Mesh Network ◽  
High Data Rate ◽  
Priority Scheduling ◽  
High Data ◽  
Wireless Mesh

<p>Wireless mesh networks (WMN) are the networks of future and can operate on multiple protocols ranging from WiFi, WiMax to long term evolution (LTE). As a recent trend defence networks are incorporating off-the-shelf, state of the art commercial protocols to enhance the capability of their networks. LTE is one such commercially available protocol which is easy to deploy and provide high data rate which can be ideally implemented in WMN for defence networks. To enable these high data rate services LTE-based defence mesh networks (DMN) are the requirement of the day and future. However, LTE-based DMN are prone to congestion at times of active operations or full-fledged war. The congestion scenarios may lead to LTE packet loss. Hence, it is pertinent that these networks amalgamate information grooming algorithms to alleviate the throughput of the network in peak hour conditions. An efficient priority scheduling algorithm based on class of service prioritisation, data rate consumption and location of origin of traffic in the DMN is proposed. The simulations demonstrate that by incorporating the proposed priority scheduling algorithm, the overall packet loss of priority packets in the DMN reduces substantially.</p>

scholarly journals Improvising Reliability and Security in Multiple Relay Network using Optimal Scheduling

2019 ◽  
Vol 8 (2) ◽  
pp. 1243-1248
Keyword(s):  
Real Time ◽  
Random Network ◽  
Scheduling Algorithm ◽  
Data Communication ◽  
Attack Detection ◽  
Relay Network ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Priority Scheduling ◽  
Byzantine Attacks

In the real-time scenario involving wireless sensor networks, the data forwarding and data gathering procedures are taking place from the remote environment. With the involvement of heterogeneous architecture and multi-hop data transmission paths, there lies a serious threat for secured data communication. There may be chances of data attacks either from the inside intruder or from the external intruder. The problem of data flow attack by adding malicious information, viz. Data injection attack and outside arbitrary attack, viz. Byzantine attacks are found to be more dangerous and cause vulnerability for the wireless sensor network. So improving the reliability and security in multi-relay networks is very much essential. In this work, the practical approach of detecting data injection and Byzantine attacks using the proposed method of random network coding is performed. Then, as improvisation measure, the priority scheduling algorithm is implemented to effectively schedule the data transfer. Real-time packets with highest priority in the distribution queue are placed first in the processing mechanism. The remaining packets are arranged based on the position of the sensor nodes and are placed in separate queues. Least priority packets can obstruct the dispensation of their direct higher precedence packets after waitlisted for a certain number of time frames. Simulation results using the NS2 environment show that using the priority scheduling algorithm has good performance values in terms of the packet delivery ratio, throughput and delay. Also, the attack detection metrics such as false positive ratio and detection ratio are also improved when using the priority scheduling algorithm. Thus an improvised priority algorithm for an uplink scheduler in WSN is implemented to increase the performance and detection metrics.

A Real-Time Scheduling Algorithm Based on Priority Table

2013 ◽  
Vol 756-759 ◽  
pp. 3929-3936
Author(s):  
Er Feng Su ◽  
Kai Long Zhang ◽  
Xing She Zhou ◽  
Chen Fan
Keyword(s):  
Real Time ◽  
Dynamic Scheduling ◽  
Heuristic Algorithms ◽  
Scheduling Algorithm ◽  
Task Type ◽  
Real Time Scheduling ◽  
Success Ratio ◽  
Time Scheduling ◽  
Definition Of ◽  
Priority Table

Among preemptive real-time uniprocessor scheduling algorithms, many researches, such as optimal and heuristic algorithms, considers only one task attribute and neglects also the variation of attributes. To understand the relations between task attributes and scheduling success ratio, we first define the sensitivity of scheduling success ratio to task attributes. Sensitivity means the intensity of variation of scheduling success ratio as task attributes varies. The paper analyzes the sensitivities of scheduling success ratio to arrival time, execution time, deadline and laxity respectively, which have close relations with scheduling. Based on the definition of sensitivity, we also define attributes influence on scheduling success ratio, which is that the greater the influence, the higher the ratio. The essence of dynamic scheduling is a scheduling based on priority, with each dynamic algorithm matching a priority table, and vice versa. It is also much easier to infer the algorithm from the priority table, which can consider several task attributes. As priority table has various designs, it can correspond to a lot of algorithms, among which, many are inefficient. In order to deal with this kind of problem, we propose a new priority table design PTBM combining deadline and laxity based on the analysis of sensitivity and influence, which makes that a task with small deadline and large laxity has higher priority. We compare PTBM with EDF, LLF and PTD through simulation. The results verify the analysis of sensitivity and influence, and it also shows that PTBM outperforms on scheduling success ratio. It needs further exploration to design more efficient priority table by analyzing more task attributes influence on scheduling success ratio, which includes criticalness, task type and so on.

A Wireless Mesh Network Node Query Method Research

2013 ◽  
Vol 416-417 ◽  
pp. 1570-1573
Author(s):  
Zhi Gang Wang
Keyword(s):  
Data Transmission ◽  
Wireless Mesh Network ◽  
Mesh Networks ◽  
Data Communication ◽  
Mesh Network ◽  
Slave Node ◽  
Wireless Mesh ◽  
Recursive Search ◽  
Manufacturing Time ◽  
Slave Mode

In the wireless mesh networks, identification of nodes does not need to set the address, only take the manufacturing time of the node as the sequence to identify. Nodes in the query and data transmission adopt a master - slave mode. The center node initializes slave-node according to the node of the manufacturing time sequence, through the search command, search to find the slave-node. The newly found node recursive search is for the next batch of nodes. Eventually form a wireless mesh network. Center nodes and the nodes of data communication are made by mesh network.

Sign in / Sign up

Export Citation Format

Share Document