FJADA: Friendship Based JellyFish Attack Detection Algorithm for Mobile Ad Hoc Networks

TCP and UDP are considered the most popular and well known transport layer protocols to facilitate the end to end communication between two nodes in the network. TCP is used as the transport layer protocol in packet delivery and error sensitive applications, where packet loss cannot be compromised. However, low-rate TCP targeted Denial of Service (DoS) attacks exploit the retransmission timeout and congestion control features of TCP protocol. These low-rate TCP targeted Denial of Service (DoS) attacks are also called JellyFish (JF) attacks. These attacks perform the malicious activities either by delaying, or periodically dropping or mis-ordering the data packets on the route from source to destination node in the network, and cause severe degradation in end-to-end throughput in the network. JellyFish attack is further classified as JF-Delay Variance Attack, JF-Periodic Drop Attack and JF-Reorder Attack based on the type of the malicious activities being performed. JellyFish attack conforms to all existing routing and packet forwarding protocol specifications, and therefore it becomes very difficult to detect its presence in the network. In this paper, a Friendship Based JellyFish Attack Detection Algorithm (FJADA) is presented for Mobile Ad Hoc Networks, where the basic concept of friendship mechanism is added to the existing Direct Trust-based Detection (DTD) algorithm to save the valuable resources of a node in monitoring the activities of its one hop neighbours, through promiscuous mode. FJADA also minimizes the possibility of overestimating the malicious behaviour of innocent nodes due to radio transmission errors, network congestion or packet collisions. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed detection algorithm.     

Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios

Disasters create emergency situations and the services provided must be coordinated quickly via a communication network. Mobile adhoc networks (MANETs) are suited for ubiquitous communication during emergency rescue operations, since they do not rely on infrastructure. The route discovery process of on-demand routing protocols consumes too much bandwidth due to high routing overhead. Frequent route changes also results in frequent route computation process. Energy efficiency, quick response time, and scalability are equally important for routing in emergency MANETs. In this paper, we propose an energy efficient reactive protocol named Weighted-CDSR for routing in such situations. This protocol selects a subset of network nodes named Maximum Weighted Minimum Connected Dominating Set (MWMCDS) based on weight, which consists of link stability, mobility and energy. The MWMCDS provides the overall network control and data forwarding support. In this protocol, for every two nodes u and v in the network there exists a path between u and v such that all intermediate nodes belong to MWMCDS. Incorporating route stability into routing reduces the frequency of route failures and sustains network operations over an extended period of time. With fewer nodes providing overall network control and data forwarding support, the proposed protocol creates less interference and consumes less energy. The simulation results show that the proposed protocol is superior to other protocols in terms of packet delivery ratio, control message overhead, transmission delay and energy consumption.     

Performance modeling and analysis of hypoexponential network servers

Hypoexponential servers are commonly seen in today’s computer and communication networks whereby incoming packets are processed by the network server in multiple stages with each stage having a different processing time. This paper presents an analytical model to capture the behavior and subsequently analyze the performance of these network servers or similarly behaving systems. From our model, we derive key performance measures and features which include CPU utilization, system idleness, mean throughput, packet loss, mean system and queuing packet delays, and mean system and queue sizes. In addition, we present two popular finite queueing models (namely, M / D / 1 / K and M / M / 1 / K) to approximate our hypoexponential model. Results show that the both of these approximate models give close results when the system queue size is large.     

Adaptive Load-Aware Congestion Control Protocol for Wireless Sensor Networks

Congestion control in wireless sensor networks (WSNs) is crucial. In this article, we discuss congestion control and the adaptive load-aware problem for sensor nodes in WSNs. When the traffic load of a specific node exceeds its the available capacity of the node, a congestion problem occurs because of buffer memory overflow. Congestion may cause serious problems such as packet loss, the consumption of power, and low network throughput for sensor nodes. To address these problems, we propose a distributed congestion control protocol called adaptive load-aware congestion control protocol (ALACCP). The protocol can adaptively allocate the appropriate forwarding rate for jammed sensor nodes to mitigate the congestion load. Through the buffer management mechanism, the congestion index of neighboring sensor nodes, and an adjustment of the adaptive forwarding rate, the degree of congestion is alleviated markedly. The performance in allocating the forwarding rate effectively to neighboring sensor nodes also improves. The ALACCP can avoid packet loss because of traffic congestion, reduce the power consumption of nodes, and improve the network throughput. Simulation results revealed that the proposed ALACCP can effectively improve network performance and maintain the fairness of networks.     

An adaptive routing algorithm considering position and social similarities in an opportunistic network

An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorithms that rely on relay nodes with appropriate behavior have been proposed. Some of these are referred to as context-ignorant routing algorithms, which manipulate flooding, and others are referred to as context-aware routing algorithms, which utilize the contextual information. We propose a routing algorithm that employs a novel similarity based on both position and social information. We combine the position similarity with the social similarity using the fuzzy inference method to obtain the enhanced performance. Through this method, the proposed algorithm utilizes more proper relay nodes in forwarding adaptively and achieves significant improvement on the performance especially under memory constrained environment. We analyze the proposed algorithm on the NS-2 network simulator with the home-cell community-based mobility model. Experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the network traffic and delivery delay.     

Secure Relay Selection of Cognitive Two-Way Denoise-and-Forward Relaying Networks

In this paper, secrecy performance of a cognitive two-way denoise-and-forward relaying network consisting of two primary user (PT and PD) nodes, two secondary source (SA and SB) nodes, multiple secondary relay (\({\textit{SR}}_i\)) nodes and an eavesdropper (E) node is considered, where SA and SB exchange their messages with the help of one of the relays using a two-way relaying scheme. The eavesdropper tries to wiretap the information transmitted between SA and SB. To improve secrecy performance of the network, two relay selection schemes called maximum sum rate and maximum secrecy capacity based relay selection (MSRRS and MSCRS) are proposed and analyzed in terms of intercept probability. It is proved that the MSRRS and MSCRS schemes have the same secrecy performance. Two parameters called average number gain and average cost gain are proposed to show the performance of the proposed relay selection schemes. Numerical results demonstrated that with 10 relay nodes, the proposed relay selection schemes can achieve, respectively, 3.7 dB and 1.9 dB’s improvements in terms of the reduced intercept probability and the enhanced secrecy capacity compared to the traditional round-robin scheme.     

无线自组织网络中一种拥塞意识的多径路由算法

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。     

Optimized Congestion Management Protocol for Healthcare Wireless Sensor Networks

The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source’s traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child’s sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.     

Impact of deployment size on the asymptotic capacity for wireless ad hoc networks under Gaussian channel model

We study the throughput capacity and transport capacity for both random and arbitrary wireless networks under Gaussian Channel model when all wireless nodes have the same constant transmission power P and the transmission rate is determined by Signal to Interference plus Noise Ratio (SINR). We consider networks with n wireless nodes \(\{v_1,v_2,\ldots,v_n\}\) (randomly or arbitrarily) distributed in a square region B _a with a side-length a. We randomly choose n _s node as the source nodes of n _s multicast sessions. For each source node v _i , we randomly select k points and the closest k nodes to these points as destination nodes of this multicast session. We derive achievable lower bounds and some upper bounds on both throughput capacity and transport capacity for both unicast sessions and multicast sessions. We found that the asymptotic capacity depends on the size a of the deployment region, and it often has three regimes.     

Throughput and delay analysis for hybrid radio-frequency and free-space-optical (RF/FSO) networks

In this paper the per-node throughput and end-to-end delay of randomly deployed (i.e. ad-hoc) hybrid radio frequency - free space optics (RF/FSO) networks are studied. The hybrid RF/FSO network consists of an RF ad hoc network of n nodes, f(n) of them, termed ‘super nodes’, are equipped with an additional FSO transceiver with transmission range s(n). Every RF and FSO transceiver is able to transmit at a maximum data rate of W ₁ and W ₂ bits/sec, respectively. An upper bound on the per node throughput capacity is derived. In order to prove that this upper bound is achievable, a hybrid routing scheme is designed whereby the data traffic is divided into two classes and assigned different forwarding strategies. The capacity improvement with the support of FSO nodes is evaluated and compared against the corresponding results for pure RF wireless networks. Under optimal throughput scaling, the scaling of average end-to-end delay is derived. A significant gain in throughput capacity and a notable reduction in delay will be achieved if \(f(n) = \Upomega\left(\frac{1}{s(n)}\sqrt{\frac{n}{\log n}}\cdot \frac{W_1}{W_2} \right)\). Furthermore, it is found that for fixed W ₁, f(n) and n where f(n) < n, there is no capacity incentive to increase the FSO data rate beyond a critical value. In addition, both throughput and delay can achieve linear scaling by properly adjusting the FSO transmission range and the number of FSO nodes.     

Energy-efficient node selection in application-driven WSN

The growth of wireless networks has resulted in part from requirements for connecting people and advances in radio technologies. Wireless sensor networks are an example of these networks in which a large number of tiny devices interacting with their environments may be inter-networked together and accessible through the Internet. As these devices may be scattered in an unplanned way, a routing protocol is needed. The RPL protocol is the IETF proposed standard protocol for IPv6-based multi-hop WSN. RPL requires that communication paths go through a central router which may provide suboptimal paths, not considering the characteristics of the applications the nodes run. In this paper is proposed an Application-Driven extension to RPL which enables to increase the WSN lifetime by limiting the routing and forwarding functions of the network mainly to nodes running the same application. As nodes may join a network at a non predictable time, they must be synchronized with respect to their application duty cycles. Therefore, nodes have to wake up and sleep in a synchronized way. In this paper it is also proposed such synchronization mechanism. The results confirm that the proposed solutions provide lower energy consumption and lower number of packets exchanged than the conventional RPL solution, while maintaining fairness and the packet reception ratio high.     

基于平均队列长度和滞留时间的RED算法

在无线通信网络环境下，提出了一种改进的基于平均队列长度和滞留时间的RED算法。这种算法根据平均队列长度和滞留时间计算数据包的丢弃概率，比传统的单纯基于平均队列长度的RED算法相比较，能更有效地实现无线网络中的拥塞控制。     

一种无线传感器网络拥塞控制机制

无线传感器网络的拥塞会增加网络延迟、降低网络吞吐量、尤其不利于传感器网络的节能。该文提出了一种能量有效的无线传感器网络拥塞控制机制,主要包括逐跳拥塞反馈和速率调节两部分。节点周期性地计算其上游节点发送速率和本地缓冲队列可用空间,并根据一定策略来推测在当前周期内发生拥塞的可能性;拥塞节点的上游节点收到拥塞反馈后根据自身缓冲队列的使用情况来降低速率,此拥塞节点同时向其下游节点申请提高发送速率;基站根据应用要求以闭环方式调节源速率。仿真实验表明,该文的拥塞控制机制不仅能有效地缓解网络拥塞,还保持了网络吞吐量的稳定并具有良好的能源有效性。     

Efficient and adaptive congestion control for heterogeneous delay-tolerant networks

Detecting and dealing with congestion in delay-tolerant networks (DTNs) is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards more central nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become saturated and unusable. We propose CafRep, an adaptive congestion aware protocol that detects and reacts to congested nodes and congested parts of the network by using implicit hybrid contact and resources congestion heuristics. CafRep exploits localised relative utility based approach to offload the traffic from more to less congested parts of the network, and to replicate at adaptively lower rate in different parts of the network with non-uniform congestion levels. We extensively evaluate our work against benchmark and competitive protocols across a range of metrics over three real connectivity and GPS traces such as Sassy [44], San Francisco Cabs [45] and Infocom 2006 [33]. We show that CafRep performs well, independent of network connectivity and mobility patterns, and consistently outperforms the state-of-the-art DTN forwarding algorithms in the face of increasing rates of congestion. CafRep maintains higher availability and success ratios while keeping low delays, packet loss rates and delivery cost. We test CafRep in the presence of two application scenarios, with fixed rate traffic and with real world Facebook application traffic demands, showing that regardless of the type of traffic CafRep aims to deliver, it reduces congestion and improves forwarding performance.     

Congestion Aware Geographic Routing Protocol for Wireless Ad Hoc and Sensor Networks

Geographic routing protocols forward packets according to the geographical locations of nodes. Thus, the criteria used to select a forwarding node impacts on the performance of the protocols such as energy efficiency and end-to-end transmission delay. In this paper, we propose a congestion aware forwarder selection (CAFS) method for a geographic routing protocol. To design CAFS, we devise a cost function by combining not only the forward progress made to a packet but also the amount of energy required for packet forwarding, forwarding direction, and congestion levels of potential forwarders. Among the potential forwarders, CAFS selects the next forwarder having the minimum cost. In our simulation studies, we compare the performance of CAFS with those of the maximum progress (MP) method and the cost over progress (CoP) method in various network conditions. The results show that compared with MP, the length of a routing path in terms of the number of hops becomes longer when CAFS is used. However, the shorter hop distance helps to avoid unnecessary retransmissions caused by packet loss in a wireless channel. In addition, since CAFS considers congestion levels of candidate forwarders, it reduces the queuing delay in each forwarder. Therefore, CAFS is superior to the MP and the CoP in terms of the energy consumption, end-to-end packet transfer delay, and the successful packet delivery rate.     

HVE-mobicast: a hierarchical-variant-egg-based mobicast routing protocol for wireless sensornets

In this paper, we propose a new mobicast routing protocol, called the HVE-mobicast (hierarchical-variant-egg-based mobicast) routing protocol, in wireless sensor networks (WSNs). Existing protocols for a spatiotemporal variant of the multicast protocol called a “mobicast” were designed to support a forwarding zone that moves at a constant velocity, \(\stackrel{\rightarrow}{v}\), through sensornets. The spatiotemporal characteristic of a mobicast is to forward a mobicast message to all sensor nodes that are present at time t in some geographic zone (called the forwarding zone) Z, where both the location and shape of the forwarding zone are a function of time over some interval (t _start ,t _end ). Mobicast routing protocol aims to provide reliable and just-in-time message delivery for a mobile sink node. To consider the mobile entity with the different moving speed, a new mobicast routing protocol is investigated in this work by utilizing the cluster-based approach. The message delivery of nodes in the forwarding zone of the HVE-mobicast routing protocol is transmitted by two phases; cluster-to-cluster and cluster-to-node phases. In the cluster-to-cluster phase, the cluster-head and relay nodes are distributively notified to wake them up. In the cluster-to-node phase, all member nodes are then notified to wake up by cluster-head nodes according to the estimated arrival time of the delivery zone. The key contribution of the HVE-mobicast routing protocol is that it is more power efficient than existing mobicast routing protocols, especially by considering different moving speeds and directions. Finally, simulation results illustrate performance enhancements in message overhead, power consumption, needlessly woken-up nodes, and successful woken-up ratio, compared to existing mobicast routing protocols.     

RM-MAC: a reservation based multi-channel MAC protocol for wireless sensor networks

Convergecast is a general communication pattern of wireless sensor networks (WSNs) in which sensed data is collected from outlying sensor nodes and is transmitted to a sink node. In this paper, we consider periodic convergecast, in which data packets are generated and transmitted repeatedly with a certain interval. To support the periodical packet delivery efficiently, we propose a reservation based multi-channel MAC protocol (RM-MAC) which employs a time reservation mechanism. Periodical packet delivery allows receiver nodes to recognize when the next packet is transmitted, which makes the nodes reserve the time for the next packet transmission. Consequently, our proposed mechanism can guarantee minimum delivery latency from source nodes to a sink node. Furthermore, RM-MAC provides a collision resolution mechanism which coordinates the reserved periodical transmissions among multiple sender nodes. It can prevent repeated collisions caused by the multiple-senders-single-receiver problem. We implement RM-MAC by using an ns-2 simulator to compare its performance with other protocols. The simulation results show that RM-MAC outperforms existing protocols in terms of energy efficiency and packet delivery latency.     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

A novel congestion control protocol with AQM support for IP-based networks

Multimedia services (Real-time and Non real-time) have different demands, including the need for high bandwidth and low delay, jitter and loss. TCP is a dominant protocol on the Internet. In order to have the best performance in TCP, the congestion window size must be set according to some parameters, since the TCP source is not aware of the window size. TCP emphasizes more on reliability than timeliness, so TCP is not suitable for real-time traffic. In this paper an active Queue management support TCP (QTCP) model is presented. Source rate is regulated based on the feedback which is received from intermediate routers. Furthermore, in order to satisfy the requirements of multimedia applications, a new Optimization Based active Queue management (OBQ) mechanism has been developed. OBQ calculates packet loss probabilities based on the queue length, packets priority and delay in routers and the results are sent to source, which can then regulate its sending rate. Simulation results indicate that the QTCP reduces packet loss and buffer size in intermediate nodes, improves network throughput and reduces delay.     

A dynamic rate control mechanism for source coded traffic in a fastpacket network

To achieve better statistical gain for voice and video traffic and to relieve congestion in fast packet networks, a dynamic rate control mechanism is proposed. An analytical model is developed to evaluate the performance of this control mechanism for voice traffic. The feedback delay for the source node to obtain the network congestion information is represented in the model. The study indicates that significant improvement in statistical gain can be realized for smaller capacity links (e.g., links that can accommodate less than 24 voice calls) with a reasonable feedback time (about 100 ms). The tradeoff for increasing the statistical gain is temporary degradation of voice quality to a lower rate. It is shown that whether the feedback delay is exponentially distributed or constant does not significantly affect performance in terms of fractional packet loss and average received coding rate. It is also shown that using the number of calls in talkspurt or the packet queue length as measures of congestion provides comparable performance