Received Data Packets Research Articles

DS-MAC: An energy efficient demand sleep MAC protocol with low latency for wireless sensor networks

Duty cycling mechanism has been widely used to conserve energy that consumed by idle listening in wireless sensor networks, while fixed duty cycling introduces transmission latency in packet delivery. End to end latency is one of the most significant factors of packets loss in wireless sensor nodes, and many techniques have been proposed based on listening adaptively to reduce delay, which are mainly designed for light traffic loads. In this paper, we propose a novel asynchronous duty cycling MAC protocol, called demand sleep MAC (DS-MAC) that allows nodes to adjust their sleep time adaptively according to the amount of the received data packets in order to efficient and effective communication in the dynamic traffic load. DS-MAC protocol attempts to transmit a series of short token packets to wake up the receiver, which avoids the overhearing problem. Nodes in DS-MAC put the prediction field into ACK packets, which decreases the waiting delay of source node. Comprehensive simulation shows that when there are variable flows, such as broadcast traffic or transmissions from hidden nodes, DS-MAC significantly decreases waiting delay and energy consumption.

Optimizing CMT performance by joint predictions of bandwidth and RTT

CMT uses the stream control transmission protocol's (SCTPs) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. As the disparity of multipaths, it is facing a great challenge to solve the disorder of the received data packets. To lighten the reordering degree and then to improve the throughput performance, we need to estimate the real-time paths' bandwidth and round trip time (RTT) as exactly as possible. In this paper, we use the extended vector (ext-vec) Kalman filter (KF) to predict the available bandwidth and RTT of each path simultaneously. Based on this, we propose a predictive path selection algorithm for CMT in SCTP. To simulate and compare the algorithms' performance, two kinds of scenarios, bandwidth sensitive scenario and time and bandwidth sensitive scenario, are built and NS-2 is used. The simulation results show that the path selection algorithm can lessen the data packets disordering by correctly predicting each path's bandwidth and RTT in real time. Comparing the existing algorithms, the algorithm can converge more quickly and can improve the system total throughput in a certain extent in bandwidth sensitive scenario. To time and bandwidth sensitive scenario, it can greatly improve the convergence speed and total throughput.

Modeling and Performance Analysis of State Transitions for Energy-Efficient Femto Base Stations

Lowering the energy required by base stations (BSs) is one of the hot issues nowadays in order to achieve green cellular networks. The energy consumption of femto BSs can be reduced, by turning off the radio interface when there is no mobile station (MS) under the coverage area of the femto BSs or MSs served by the femto BSs do not transmit or receive data packets for a long time, especially late at night. In the energy-efficient femto BSs, if MSs have any data packet to transmit and the radio interface of femto BSs is in the off state, MSs wake up the radio interface of femto BSs by using an additional low-power radio interface. In this paper, active (data), idle, active (signaling), sleep entering, sleep and waking up states are defined for the state model for the energy-efficient femto BSs, and the state transitions are modeled analytically. The steady-state probability of each state is derived thoroughly using a semi-Markov approach. Then, the performance of the energy-efficient femto BSs is analyzed in detail, from the aspects of energy consumption, cumulative average delay, cost and low-power radio signaling load. From the results, the tradeoff relationship between energy consumption and cumulative average delay is analyzed in detail, and it was concluded that an appropriate inactivity timer value should be selected to balance the tradeoff.

Mobile agent-based cross-layer anomaly detection in smart home sensor networks using fuzzy logic

Despite the rapid advancements in consumer electronics, the data transmitted by sensing devices in a smart home environment are still vulnerable to anomalies due to node faults, transmission errors, or attacks. This affects the reliability of the received sensed data and may lead to the incorrect decision making at both local (i.e., smart home) and global (i.e., smart city) levels. This study introduces a novel mobile agent-based cross-layer anomaly detection scheme, which takes into account stochastic variability in cross-layer data obtained from received data packets, and defines fuzzy logic-based soft boundaries to characterize behavior of sensor nodes. This cross-layer design approach empowers the proposed scheme to detect both node and link anomalies, and also effectively transmits mobile agents by considering the communication link-state before transmission of the mobile agent. The proposed scheme is implemented on a real testbed and a modular application software is developed to manage the anomaly detection system in the smart home. The experimental results show that the proposed scheme detects cross-layer anomalies with high accuracy and considerably reduces the energy consumption caused by the mobile agent transmission in the poor communication link-state situations.

A sequence number based bait detection scheme to thwart grayhole attack in mobile ad hoc networks

Wireless shared medium, randomly moving nodes and multi-hop architecture make mobile ad hoc networks vulnerable to various network layer threats. Grayhole attack is such a prominent network layer threat, in which a malevolent node attempts to establish a bogus route passing through itself and performs packet forwarding misbehavior by dropping a subset of the received data packets in order to degrade the network performance. In this paper, we address this issue by proposing a heuristic approach, referred to as sequence number based bait detection scheme, which attempts to isolate malevolent nodes during route discovery process. The mechanism is incorporated with ad hoc on-demand distance vector routing protocol. Performance of the proposed scheme is compared with an existing scheme under three grayhole adversary models adopting distinct mode of operations. Simulation results under various network parameters depict that the proposed scheme improves network performance depending upon the mode of operations of the adversaries.

A Stable Path Routing Protocol for Cognitive Radio Ad hoc Networks based on the Maximum Number of Common Primary User Channels

We propose a novel local spectrum knowledge-based distributed stable path routing protocol for cognitive radio ad hoc networks (CRAHNs) where the unlicensed secondary users (SUs) make use of the licensed channels of the Primary Users (PUs) when the latter are not actively using the channels. We model a time-variant CRAHN of SUs with links between any two SUs if they have at least one common PU channel available for use in their neighborhood and the weight of an edge is the number of such common PU channels available for use. Referred to as the Maximum Common Primary User channel-based Routing (MCPUR) protocol, the proposed protocol prefers to choose an SU-SU source-destination ( s-d ) path with the largest value for the sum of the number of common PU channels available for use across each of its constituent edges. Our hypothesis is that such an s-d route is likely to exist for a longer time (and incur fewer broadcast route discoveries) as the end nodes of the constituent SU-SU edges are more likely to have at least one common available PU channel that can be used to complete the transmission and reception of data packets. Simulation results confirm our hypothesis to be true: the number of path transitions incurred with MCPUR could be at most 62% lower than that of the path transitions incurred with a minimum hop-based shortest path routing (SPR) protocol. The tradeoff is a low-moderate increase in the hop count per path (as large as 17%)

DECISION MAKING APPROACH TO PREFER ROUTE REPAIR TECHNIQUE IN AODV ROUTING PROTOCOL OF MANET

MANET is a dynamic environment of mobile nodes and suffers link failure problem i.e. due to node mobility, loss of energy, node failure etc. To overcome the broken link problem, initiated route repair mechanism. The suggested two route repair techniques are used to repair the broken link of the network. Either the routes can be repaired by re-establishing a new route starting from the source node or the routes can be repaired by the node that detects the link break along the path. The mechanism is proposed to prefer route repair techniques on the basis of decision. According to this approach, the different route repair values are defined on the basis of the active path of network and calculate the link break value of the network for finding in which location the link break is occurring to initiate route repair mechanism. For implementation, apply the proposed approach on an AODV routing protocol and check which route repair techniques are used. Simulate the results on the basis of different parameter i.e. sent data packets, received data packets, dropped data packets and energy consumption.

A Receiver-Initiated MAC Protocol with Packet Train Design for Underwater Acoustic Sensor Networks

An efficient MAC protocol can reduce the collision and increase the throughput of the wireless sensor networks. Due to the long propagation delay and the low data rate, many transmissions of control packets will occupy a lot of channel resources, power and transmission time. In this paper, we propose a receiver-initiated MAC protocol with packet train for UWSN called multi-receiver MAC protocol (MR-MAC). Our protocol will increase of the throughput and reduce of the transmission of control packet for handshaking. Our MR-MAC protocol can make more than two nodes to communicate in one handshake held by a main receiver. By scheduling the packet transmission time, the data packet will be sent in a packet train manner and the receiver can receive data packet without collision. Our simulation results show that our protocol can increase the throughput and decrease the packet delay than the other existing MAC protocols.

Intrusion detection technique for black hole attack in mobile ad hoc networks

A black hole attack is particularly harmful against routing in mobile ad hoc networks where a malicious node tries to capture the path toward itself by falsely claiming a fresh and shortest route to the destination, and then drops all the receiving data packets instead of forwarding them to the destination node. This paper presents an intrusion detection technique for detecting and isolating the black hole attack from AODV-based MANETs by employing the detection mechanism at the source node. The detection mechanism uses the destination sequence number, hop count, and average of packet processing delay and queueing delay time of routing packets in order to detect the black hole attack. The main strength of the proposed detection mechanism is to preserve the network resources by eliminating additional control traffic overhead. The simulation results demonstrate the effectiveness of the proposed mechanism in the presence of black hole attacks.

SRDA: Smart Reputation-Based Data Aggregation Protocol for Wireless Sensor Network

Wireless sensor network is a self-organizing multihop network, which is composed of a large number of wireless sensor nodes and usually deployed in unattended environment to collect target information. At present, WSN is facing a growing range of security threats owing to its wireless and resource-constrained characteristics. Compromised sensor nodes can easily corrupt data accuracy and integrity by falsifying sensed information, selectively forwarding or misdirecting received data packets during the process of data aggregation. To solve these security problems, we propose a smart reputation-based data aggregation protocol for WSNs (SRDA) that can provide adequate protection of data accuracy and integrity for wireless sensor network. The simulation results indicate that SRDA can effectively identify the compromised nodes and isolate them from the network by the deployment of the smart reputation system.

From Instantly Decodable to Random Linear Network Coded Broadcast

Our primary goal in this paper is to better under- stand and extend the achievable tradeoffs between the through- put and decoding delay performance of network coded wireless broadcast. To this end, we traverse the performance gap between two linear network coding schemes: random linear network cod- ing (RLNC) and instantly decodable network coding (IDNC). Our approach is to appropriately partition a block of partially received data packets into subgenerations and broadcast them separately using RLNC. Through analyzing the factors that af- fect the performance of a generic partitioning scheme, we are led to develop a coding framework in which subgenerations are created from IDNC coding sets in an IDNC solution. This coding framework consists of a series of coding schemes, with classic RLNC and IDNC identified as two extreme schemes. We develop two basic partitioning guidelines, including disjoint partitioning and even partitioning. We design various implementations of this coding framework, such as partitioning algorithms and gener- ation scheduling strategies, to further improve its throughput and decoding delay, to manage feedback frequency and coding complexity, or to achieve in-block performance adaption. Their effectiveness is verified through extensive simulations, and their performance is compared with an existing work in the literature.

A Secure Intrusion-Detection System Using an Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETS

The migration to wireless network from wired network has been a global trends in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most important and unique applications. On the contrary to traditional network architecture, MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme and a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction along with the EAACK demonstrates higher malicious behavior detection rates in certain circumstances while does not greatly affect the network performances of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme.

Wireless Concrete Construction Monitoring System Based on Mobile-Agent and GPRS

By monitoring and controlling the temperature and stress of concrete in the process of mass concrete casting, the temperature stress can be reduced effectively. In response to problems of traditional temperature and strain monitoring method, a new kind of distributed temperature and strain monitoring system based on mobile-agent and GPRS had been proposed. And also this system design a data integration middleware based on mobile-agent which verify the validity of the middleware through the experiment on Genomote nodes of network. Through GPRS network, remote data monitoring center receives data packets of temperature and strain of the concrete. The real-time display function of temperature and strain parameters was achieved by PC software programmed by Labview. The experiment show that the temperature acquisition value and the standard temperature error is within the scope of the permit (<1°C) and the system is stable, reliable for the needs of the remote monitoring.

Adjusting Control Packet Transmission Intervals in Low Power Sensor Systems

In order to construct an efficient wireless sensor system, it is necessary to increase the lifetime of its battery-operated sensor nodes. To this end, a wireless body sensor system adopts a transmission power control (TPC) mechanism. However, existing TPC mechanisms adjust the transmission power level (TPL) according to the received signal strength indication (RSSI) value of the most recently received data packet. Therefore, they do not effectively cope with dynamically changing wireless body channel environments. In particular, when a wireless channel is unstable, changes in the TPL should be avoided to prevent energy consumption due to unnecessary transmission and reception of control packets. Accordingly, this paper proposes a new TPC mechanism that adaptively changes the control packet transmission interval on the basis of the current channel condition. Further, actual sensors are used to experimentally verify that the proposed mechanism (1) performs well in all channel environments and (2) facilitates the construction of an efficient wireless body sensor system.

English

An mobile ad-hoc network (MANETs) is a set of limited range wireless nodes that function in a cooperative manner so as to increase the overall range of the network. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist. One such routing misbehavior is that some selfish nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme.

A Link Stability Prediction-Based Multicast Routing Protocol in Mobile Ad Hoc Networks

Mobile Ad Hoc networks have dynamic topology since all nodes have a random mobility behavior which increases rerouting frequency and degrades network communication performance.A more stable route can reduce rerouting frequency and prolong route lifetime.In this paper,we propose a novel link stability prediction model,via sampling the signal strength of the received data packets,and integrate the proposed prediction model into the traditional multicast routing protocol.Simulation results have been conducted to verify the efficiency of the proposed prediction scheme.Moreover,with a lower control overhead,this extended protocol LSPMR(Link Stability Prediction-based Multicast Routing Protocol) achieves a remarkable improvement in the packet delivery ratio,and decreases the average end-to-end delay.

A Tag Encoding Scheme against Pollution Attack to Linear Network Coding

Network coding allows intermediate nodes to encode data packets to improve network throughput and robustness. However, it increases the propagation speed of polluted data packets if a malicious node injects fake data packets into the network, which degrades the bandwidth efficiency greatly and leads to incorrect decoding at sinks. In this paper, insights on new mathematical relations in linear network coding are presented and a key predistribution-based tag encoding scheme KEPTE is proposed, which enables all intermediate nodes and sinks to detect the correctness of the received data packets. Furthermore, the security of KEPTE with regard to pollution attack and tag pollution attack is quantitatively analyzed. The performance of KEPTE is competitive in terms of: low computational complexity; the ability that all intermediate nodes and sinks detect pollution attack; the ability that all intermediate nodes and sinks detect tag pollution attack; and high fault-tolerance ability. To the best of our knowledge, the existing key predistribution-based schemes aiming at pollution detection can only achieve at most three points as described above. Finally, discussions on the application of KEPTE to practical network coding are also presented.

Decoding Probability in Random Linear Network Coding with Packet Losses

We focus on a network where n sources send data to k destinations, through m≥ n relay nodes employing random linear network coding. The coefficients used to encode the data packets are extracted from a Galois field of size q. Unlike previous work, we consider that the relay nodes may not receive some packets due to link failures. This implies that a destination may be unable to successfully decode the received data packets due to both missing packets at the relays and linearly dependent coefficient vectors. In this scenario, we compute the exact probability of successful decoding at a destination node and we show the impact of the system parameters on the performance. In particular, our study highlights the fact that the network coding scheme behaves as an erasure correcting code, whose erasure correcting capability is determined by the number of available relays.

A Markov Decision Theoretic Approach to Pilot Allocation and Receive Antenna Selection

This paper considers antenna selection (AS) at a receiver equipped with multiple antenna elements but only a single radio frequency chain for packet reception. As information about the channel state is acquired using training symbols (pilots), the receiver makes its AS decisions based on noisy channel estimates. Additional information that can be exploited for AS includes the time-correlation of the wireless channel and the results of the link-layer error checks upon receiving the data packets. In this scenario, the task of the receiver is to sequentially select (a) the pilot symbol allocation, i.e., how to distribute the available pilot symbols among the antenna elements, for channel estimation on each of the receive antennas; and (b) the antenna to be used for data packet reception. The goal is to maximize the expected throughput, based on the past history of allocation and selection decisions, and the corresponding noisy channel estimates and error check results. Since the channel state is only partially observed through the noisy pilots and the error checks, the joint problem of pilot allocation and AS is modeled as a partially observed Markov decision process (POMDP). The solution to the POMDP yields the policy that maximizes the long-term expected throughput. Using the Finite State Markov Chain (FSMC) model for the wireless channel, the performance of the POMDP solution is compared with that of other existing schemes, and it is illustrated through numerical evaluation that the POMDP solution significantly outperforms them.

I-2ACK: Preventing Routing Misbehavior in Mobile Ad hoc Networks

Mobile Ad hoc NETwork (MANET) is considered as network without infrastructure where communication between the mobile nodes solely depends on the routing protocols which work on assumption that nodes are fully cooperative. In the presence of misbehaving nodes, most of the routing protocols show dropped performance and in some case whole of the network fails. Misbehaving nodes interrupt the data flow by either by dropping or refusing to forward the data packets thus forcing routing protocol to restart the route-discovery or to select an alternative route if available which may again include some misbehaving nodes, thereby forming a loop, enforcing source node to conclude that data cannot be further transferred. In this paper, a new reputation based approach is proposed which deals with such misbehaving nodes and can be integrated on top of any source routing protocol Proposed approach consists of detection and isolation of misbehaving nodes and based on sending acknowledgement packets back for reception of data packets.