Alarm Packets Research Articles

An Exact Analytical Model for an IoT Network with MMPP Arrivals

Analytical modeling of the Internet of Things (IoT) networks is challenging. This is due to the presence of a large number of devices in these networks and the complexity of the priorities between different types of traffic. Taking these aspects into account, the objective of this paper is to analyze the performance of an IoT network where the IoT devices work independently of one another. To this end, we developed a novel multi-dimensional Continuous-Time Markov Chain (CTMC) model with threshold-based preemption. In this model, each IoT device is modeled as a Markov Modulated Poisson Process (MMPP) that can transmit regular and alarm packets. Alarm packets have higher priority over regular packets. To measure access to the channel between alarm and regular packets, we introduced a threshold parameter where the threshold is the number of packets in the alarm queue that indicates when preemption starts. The performance measures include blocking probability, the average delay of regular packets and alarm packets, discard rate , and success probability of regular packets. Comprehensive numerical analysis was conducted. Our results indicate that impact of the threshold on performance measures is higher on the boundary values of the threshold. The model was proven to be efficient in analyzing the performance of IoT networks on a wide range of parameter values. These results may be used in the future to develop and assess a protocol that utilizes a scheduling algorithm with a dynamic preemption threshold to optimize the performance of the IoT network.

FFSC: An Energy Efficiency Communications Ap-proach for Delay Minimizing in Internet of Things

It is desirable for alarm packets to be forwarded to the sink as quickly as possible in wireless sensor networks. In this paper, we initially analyze the theory of the relationships between network configurations and network lifetime as well as transmission delay. Then, we propose an approximate optimization approach to minimize the end-to-end delay with a reduced complexity of configuration under the condition that the network lifetime remains greater than the specified target value. A local forwarding approach named Fast data collection for nodes Far away from the sink and slow data collection for nodes Close to the Sink (FFSC) is proposed. This approach is energy efficient. Moreover, it can further reduce the end-to-end delay. Both the comprehensive theoretical analysis and the experimental results indicate that the performance of FFSC is better than the methods proposed by previous studies. Relative to the direct forwarding strategy, the FFSC approach can reduce the delay by 7.56%–23.16% and increase the lifetime by more than 25%. It can also increase the energy efficiency as much as 18.99%. Relative to the single fixed threshold strategy, the FFSC approach can reduce the delay by 4.16%–9.79% and increase the energy efficiency by 19.28% while still guaranteeing the same lifetime as those previous methods.

Ant colony optimization based multi-faults localization mechanism in elastic optical networks

In order to withstand and recovery from multi-faults in elastic optical networks, we propose a novel multi-fault localization mechanism based on ant colony optimization and mixed line-rates. Multi-faults localization has been proved to be a NP-complete problem in wavelength switched optical networks, and all existing multi-faults localization algorithms require time that is super polynomial in the input size. Furthermore, multi-faults localization in elastic optical networks gets new features that the affected high-bit-rate services will play a greater role than the affected low-bit-rate services. In order to handle the mixed line-rates, we introduce the dependency metric which is used to describe dependency between alarms and likely causes. We establish the linear programming model for multi-faults localization and propose an objective function while considering the mixed line-rates. We implement the ant colony optimization based multi-faults localization mechanism on the stateful PCE-based multi-domain elastic optical networks test bed. The numerical results show that ant colony optimization based multi-faults localization mechanism has low flooding time and alarm packets, high success rate compared with the existing localization algorithms. We choose the best configuration of ant colony optimization based multi-faults localization by adjusting the parameters.

Performance Evaluation of Least Disruptive Topology Repair Algorithm (Ledir) Using Ns-2

In wireless sensor networks, sensor nodes fail either when some critical event occurs at the node or when the battery of the nodes is completely drained. If the remaining nodes in the sensor network are not aware of the node failure, the network might under undergo significant broadcast delay and path loss. An alarm packet has to be broadcast throughout the network when any critical event occurs and the transmission path must be recovered to achieve better quality of service in the sensor network. This paper utilizes least disruptive topology repair (LeDir) algorithm to minimize the power consumption and to handle such critical events. LeDir algorithm is used to recover the transmission path and to ensure that the quality of service issues in the network is met. The variations in the throughput, roundtrip time, broadcast delays and packet delivery ratio of the network are observed by performing multiple NS-2 simulations. It is observed that the throughput of the network could be quickly regained when the transmission path is recovered by node replacement.

Enhanced Green Firewall For Efficient Detection And Prevention Of Mobile Intruder Using Greylisting Method

Wireless sensor networks are nowadays widely popular and has become an integral part in the military applications for human monitoring, thermal detection etc. Security of Wireless sensor network (WSN) becomes a very important issue with the rapid developme nt of WSN that is vulnerable to a wide range of attacks such as sinkhole attacks due to deployment in the hostile environment and having limited resources. Intrusion detection system is one of the major and efficient defensive methods against attacks in WS N. One such detection technique is black listing technology.But using only Black listing technology is not suitable for a mobile intruder since it was designed considering only a static intruding node in a WSN. So it is necessary to build an energy efficient Intrusion detection system for sinkhole attack by a mobile intruder in WSN. We are intended to design an energy efficient system for detection of sinkhole and elimination of a mobile intruder from WSN nodes using a technology called greylisting. This t echnology uses pre alarm packets to warn the neighboring nodes about the intruder and the energy consumed by the pre alarm packets for making an alarm is much lesser than that of the packets used in black listing technology. Thus this method will serve asthe solution for the dilemma in providing the security for WSN in sinkhole attack.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al.

Efficient Event Detecting Protocol in Event-Driven Wireless Sensor Networks

The most important goal in event-driven wireless sensor networks is to transmit the event information to users as soon as possible. One of the most important factors that would make it possible to reach this goal is the design of efficient detecting protocols. In this paper, we present an efficient event detecting protocol (EEDP) specified for event monitoring applications. In the event occuring area, each node broadcasts its primary detection result to make a decision corporately. And then the decision-made node will choose the next hop using the underlying routing protocol to forward a single alarm packet. To improve the reliable transmission of the single alarm packet, we use a dynamic multicopy scheme similar as conventional multipath routing for continuous flow. The simulation results validate that EEDP is a practical and efficient protocol for event detection applications where the constraints of end-to-end delay and reliability are stringent.

Fault management: analysis of fault location algorithm in optical network

This article proposes a new fault location mechanism in optical network. In this mechanism, a network alarm packet format with time-stamp is introduced to implement fast restoration. In locating the fault, the existing schemes are usually complex and inaccessible when solving the multifailure location problem. For multifailures, the proposed mechanism using time-stamps is more efficient in locating the fault and decreasing computational complexity.

유무선 기반 멀티미디어 임베디드 시스템을 위한 네트워크 동기화 모듈 연구 및 구현

It is common to use PC or Digital picture frame in stand-alone fashion to view images, movies, or to listen MP3 musics which are considered as multimedia contents, However, such existing methods have weakness for expanding network requirements or augmenting extra data, in such case inevitably requiring external devices. With keeping in mind for such expansion, in this study, we have suggested a new concepts of network module which may utilize an image server for data transmission, in the proposed module, data alarm packet was defined for alerting incoming data from the image server and it became possible to synchronize between the image server and device not only in wired but also in wireless environments through UART. The method consists of a control module for an image server and a synchronization module between the server and the device. We have also tested the feasibility for future commercial usages such as advertisements through performance evaluations.