Article: Cluster-level based link redundancy with network

coding in duty cycled relay wireless sensor networks

Abstract
Reliability and efficiency become more important in data transmission application in
wireless sensor networks (WSNs). Many studies have been proposed to improve the
network reliability and energy efficiency, but most of them were complicated to
implement in energy-limited WSNs. This paper is dedicated to research a high
performance protocol named NCCM-DC, which is a Network Coding based Clusterlevel Multipath protocol in Duty-Cycled WSNs. While meeting the transmission
reliability, NCCM-DC can also balance the workload and make full use of energy. In
NCCM-DC protocol, the nodes are organized into a cluster and the cluster is used as
a basic unit to construct the multipath. Thus, the traffic load can be dispersed to
more nodes evenly and a topological structure for cooperative transmission can be
formed. Meanwhile, with the advantage of path redundancy and network coding,
NCCM-DC improves the transmission reliability. In order to improve the energy
efficiency, we focus on the dormancy mechanism and collaborative state transition
algorithm. As the low cost in routing discovery phase and the random operations of
coding coefficient in Galois Field, NCCM-DC is applicable to energy-limited WSNs.
Theoretical analysis and experimental simulation confirms that NCCM-DC can meet
the requirements of network reliability and energy efficiency.

Keywords

Wireless sensor networks;

Network coding;

Cluster-level multipath routing;

Duty cycle;

Reliability;

Energy efficiency

Opportunistic Flooding in Low-Duty-Cycle Wireless

Sensor Networks with Unreliable Links
Flooding service has been investigated extensively in wireless networks to efficiently
disseminatenetwork-wide commands, configurations, and code binaries. However,
little work has been done on low-duty-cycle wireless sensor networks in which
nodes stay asleep most of the time and wake up asynchronously. In this type
of network, a broadcasting packet is rarely received by multiple nodes
simultaneously, a unique constraining feature that makes existing solutions
unsuitable. In this paper, we introduce Opportunistic Flooding, a novel design
tailored for low-duty-cycle networks with unreliablewireless links and
predetermined working schedules. Starting with an energy-optimal tree structure,
probabilistic forwarding decisions are made at each sender based on the delay
distribution of next-hop receivers. Only opportunistically early packets are forwarded
via links outside the tree to reduce the flooding delay and redundancy in
transmission. We further propose a forwarder selection method to alleviate the
hidden terminal problem and a link-quality-based backoff method to resolve
simultaneous forwarding operations. We show by extensive simulations and testbed implementations that Opportunistic Flooding is close to the optimal performance
achievable by oracle flooding designs. Compared with Improved Traditional
Flooding, our design achieves significantly shorter flooding delay while consuming
only 20-60% of the transmission energy.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?
arnumber=6552199&newsearch=true&queryText=:%20Cluster-level%20based%20link
%20redundancy%20with%20network%20coding%20in%20duty%20cycled%20relay
%20wireless%20sensor%20networks%20

Article: QoS-aware multi-plane routing method for OSPFbased IP access networks

Abstract
This paper presents a study of a method termed, multi-plane routing, that maximizes
path diversity in IP routing and is targeted for IP access networks (AN). The
motivation for the work is in the specific shortcomings of the conventional intradomain IP routing principles such as shortest-path and best-effort when applied in
IP ANs. We generalize these networks as the transit between the access routers and
gateway and they range from a simple tree to meshed tree topologies. The method
uses Multi-Topology OSPF standardized by the IETF and instantiates multiple OSPF
installations in networks, each installation utilizing a portion of the topology in the
conventional manner, i.e. routing plane (RP). Hence, all links are utilized by having at
least one standard OSPF routing installation including them in the paths between
access router and gateway. The method functions on extensions in routers and
simple packet tagging allowing the routers to install and separate between paths of
each RP. Routing is facilitated by the proposed methods algorithms for network
planning and traffic engineering. The former is called the offline algorithm rendering
the optimum number of RPs in an arbitrary topology by independently setting link
weights for each plane. The latter is called the online algorithm that applies a policybased routing scheme for dynamically selecting the best RP based on the introduced
QoS-aware cost function. The paper concludes by significant improvements in
throughput, packet loss rate, session blocking and delays for numerous cases of
topologies differing in numbers of networks nodes and degrees of meshing.

Keywords

Multi-plane routing;

Traffic engineering;

Open Shortest Path First;

Access networks;

Routing

Priority-aware pricing-based capacity sharing scheme for

beyond-wireless body area networks
Abstract
In this paper, a radio resource allocation scheme for wireless body area networks
(WBANs) is proposed. Unlike existing works in the literature, we focus on the
communications in beyond-WBANs, and study the transmission scheduling under a
scenario that there are a large number of gateways associating with one base station
of medical centers. Motivated by the distinctions and requirements of beyond-WBAN
communications, we introduce a priority-aware pricing-based capacity sharing
scheme by taking into account the quality of service (QoS) requirements for different
gateways. In the designed scheme, each gateway is intelligent to select transmission
priorities and data rates according to its signal importance, and is charged by a price
with regard to its transmission request. The capacity allocation is proceeded with
guarantee of the absolute priority rule. In order to maximize the individual utility,
gateways will compete with each other by choosing the optimal transmission
strategies. Such decision process is formulated as a non-atomic game. Theoretical
analyses show that our proposed pricing-based scheme can lead to an efficient
Wardrop equilibrium. Through numerical results, we examine the convergence of
strategy decisions, and demonstrate the effectiveness of our proposed mechanism in
improving the utilities of gateways.

Keywords

Transmission scheduling;

Quality of service;

Network pricing;

Beyond-WBAN

Article: A practical cross layer cooperative MAC framework for

WSNs
Abstract
The evolving Internet of Things is expected to enable realization of wireless sensor
networks (WSNs) for a variety of applications. Energy efficiency and reliability are
the key criteria for the success of WSNs of IoT. In this article, a cooperative medium
access control (MAC) framework is proposed for improving the performance and
energy efficiency of WSNs, while satisfying a given reliability constraint. The energyreliability trade off is achieved through a relay selection and power assignment
algorithm, which is implemented within the COMAC cooperative MAC protocol that
enables the coordination of candidate relays, calculation of the decision metrics,
selection and actuation of the relay nodes with optimal power levels for cooperation.
The proposed cross-layer MAC framework is evaluated in terms of energy costs as
well as network performance metrics, in terms of throughput, delay and overhead. It
is shown that the network throughput can be improved significantly, while the energy
consumption is reduced by at least two orders of magnitude as compared to
standard Zigbee WSNs, at negligibly small overhead and computational costs.

Keywords

Cooperative MAC;

Medium access control;

Energy efficiency;

Wireless sensor network;

Empirical evaluation of OI-MAC: Direct interconnection

between wireless sensor networks for collaborative
monitoring
Cooperation between co-located Wireless Sensor Networks (WSNs) has the potential to
present new opportunities for novel applications and provide network performance
improvements. The traditional interconnection approach for WSNs is based on a
backbone network such as the Internet, but this may have intermittent or unavailable
connectivity in remote locations. To address this, Opportunistic Direct Interconnection
(ODI) has been proposed to allow distinct and independent WSNs to communicate
directly with neighbouring networks, and OI-MAC is a link-layer protocol which
implements this functionality. However, OI-MAC has not been experimentally validated,
instead with analysis performed through simulation. In this paper, we present a practical
implementation of OI-MAC using two separate multi-hop networks with 6 sensor nodes
in each. We validate its effective operation through experimentally obtained timing
diagrams, sensor data output, and energy consumption. Results show successful crossnetwork packet communication, while networks remain independent by maintaining
individual configurations and communication channels. Furthermore, we show that the
process of discovering neighbouring networks has an insignificant impact on energy
consumption.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7133594&queryText=A
%20practical%20cross%20layer%20cooperative%20MAC%20framework%20for
%20WSNs&newsearch=true

A Simple Recruitment Scheme of Multiple Nodes for

Cooperative MAC
Physical (PHY) layer cooperation in a wireless network allows neighboring nodes to
share their communication resources in order to create a virtual antenna array by means
of distributed transmission and signal processing. A novel medium access control (MAC)
protocol, called CoopMAC, has been recently proposed to integrate cooperation at the
PHY layer with the MAC sublayer, thereby achieving substantial throughput and delay
performance improvements. CoopMAC capitalizes on the broadcast nature of the
wireless channel and rate adaptation, recruiting a single relay on the fly to support the
communication of a particular source-destination pair. In this paper, we propose a crosslayer rate-adaptive design that opportunistically combines the recruitment of
multiple cooperative nodes and carrier sensing multiple access with collision avoidance.
We focus on a single-source single-destination setup, and develop a
randomized cooperative framework, which is referred to as randomized CoopMAC
(RCoopMAC). Thanks to the randomization of the coding rule, the RCoopMAC approach
enables the blind participation of multiple relays at unison relying only on the mean
channel state information (CSI) of the potential cooperating nodes, without introducing
additional signaling overhead to coordinate the relaying process. The proposed
RCoopMAC scheme is not only beneficial in substantially improving the link quality and
therefore the sustainable data rates but, thanks to the decentralized and agnostic coding
rule, it also allows to effectively recruit multiple relays in a robust fashion, i.e., even when
the required mean CSI is partially outdated.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5577812&queryText=A
%20practical%20cross%20layer%20cooperative%20MAC%20framework%20for
%20WSNs&newsearch=true

Controlled access to cloud resources for mitigating Economic

Denial of Sustainability (EDoS) attacks
Abstract
Cloud computing is a paradigm that provides scalable IT resources as a service over
the Internet. Vulnerabilities in the cloud infrastructure have been readily exploited by
the adversary class. Therefore, providing the desired level of assurance to all
stakeholders through safeguarding data (sensitive or otherwise) which is stored in
the cloud, is of utmost importance. In addition, protecting the cloud from adversarial
attacks of diverse types and intents, cannot be understated. Economic Denial of
Sustainability (EDoS) attack is considered as one of the concerns that has stalled
many organizations from migrating their operations and/or data to the cloud. This is
because an EDoS attack targets the financial component of the service provider. In
this work, we propose a novel and reactive approach based on a rate limit technique,
with low overhead, to detect and mitigate EDoS attacks against cloud-based
services. Through this reactive scheme, a limited access permission for cloud
services is granted to each user. Experiments were conducted in a laboratory cloud
setup, to evaluate the performance of the proposed mitigation technique. Results
obtained show that the proposed approach is able to detect and prevent such an
attack with low cost and overhead.

Keywords

Economic Denial of Sustainability attacks (EDoS);

Cloud computing;

Network security;

Rate control

http://www.journals.elsevier.com/computer-networks/recent-articles/

Controlled Virtual Resource Access to Mitigate Economic

Denial of Sustainability (EDoS) Attacks against Cloud
Infrastructures
Service providers of the cloud have witnessed a rapidly growing demand to provide
services to end-users in a timely manner. Security vulnerabilities against the cloud
infrastructure cannot be overlooked. Through exploitation of such weaknesses, the
adversary class may disrupt routine cloud operations, and have a debilitating effect on
the reputation of the service provider. One attack type specifically affecting cloud
services is the Economic Denial of Sustainability (EDoS) attack. Through such a
malicious attack, the ability of the service provider to dynamically stretch and
accommodate increasing numbers of requests from end-users, is exploited, to make it
economically unviable for the service provider to sustain further demand for service from
legitimate end-users. In this paper, we propose a novel approach for selectively
controlling user requests for service, implemented at the service provider's end. Through
this scheme, we reduce i.e mitigate the effects of an imminent EDoS attack against
critical cloud resources. Incoming requests are classified into normal or suspicious.
Subsequently, further analysis is conducted to ensure that priority to cloud service
access is given to those end-users tagged as being legitimate, whereas, suspect users
are given lesser priority to service access, until they are eventually removed from the
suspect list. Simulations were conducted to study the performance of the scheme, with
results showing promise.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?&arnumber=6821014

1.Controlled Virtual Resource Access to Mitigate Economic Denial of Sustainability

(EDoS) Attacks against Cloud Infrastructures
2. Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with
Unreliable Links
3. Empirical evaluation of OI-MAC: Direct interconnection between wireless sensor
networks for collaborative monitoring
4.A Simple Recruitment Scheme of Multiple Nodes for Cooperative MAC