2,774 research outputs found
Connectivity analysis in clustered wireless sensor networks powered by solar energy
©2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Emerging 5G communication paradigms, such as machine-type communication, have triggered an explosion in ad-hoc applications that require connectivity among the nodes of wireless networks. Ensuring a reliable network operation under fading conditions is not straightforward, as the transmission schemes and the network topology, i.e., uniform or clustered deployments, affect the performance and should be taken into account. Moreover, as the number of nodes increases, exploiting natural energy sources and wireless energy harvesting (WEH) could be the key to the elimination of maintenance costs while also boosting immensely the network lifetime. In this way, zero-energy wireless-powered sensor networks (WPSNs) could be achieved, if all components are powered by green sources. Hence, designing accurate mathematical models that capture the network behavior under these circumstances is necessary to provide a deeper comprehension of such networks. In this paper, we provide an analytical model for the connectivity in a large-scale zero-energy clustered WPSN under two common transmission schemes, namely, unicast and broadcast. The sensors are WEH-enabled, while the network components are solar-powered and employ a novel energy allocation algorithm. In our results, we evaluate the tradeoffs among the various scenarios via extensive simulations and identify the conditions that yield a fully connected zero-energy WPSN.Peer ReviewedPostprint (author's final draft
On Content-centric Wireless Delivery Networks
The flux of social media and the convenience of mobile connectivity has
created a mobile data phenomenon that is expected to overwhelm the mobile
cellular networks in the foreseeable future. Despite the advent of 4G/LTE, the
growth rate of wireless data has far exceeded the capacity increase of the
mobile networks. A fundamentally new design paradigm is required to tackle the
ever-growing wireless data challenge.
In this article, we investigate the problem of massive content delivery over
wireless networks and present a systematic view on content-centric network
design and its underlying challenges. Towards this end, we first review some of
the recent advancements in Information Centric Networking (ICN) which provides
the basis on how media contents can be labeled, distributed, and placed across
the networks. We then formulate the content delivery task into a content rate
maximization problem over a share wireless channel, which, contrasting the
conventional wisdom that attempts to increase the bit-rate of a unicast system,
maximizes the content delivery capability with a fixed amount of wireless
resources. This conceptually simple change enables us to exploit the "content
diversity" and the "network diversity" by leveraging the abundant computation
sources (through application-layer encoding, pushing and caching, etc.) within
the existing wireless networks. A network architecture that enables wireless
network crowdsourcing for content delivery is then described, followed by an
exemplary campus wireless network that encompasses the above concepts.Comment: 20 pages, 7 figures,accepted by IEEE Wireless
Communications,Sept.201
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
Secure Routing in Wireless Mesh Networks
Wireless mesh networks (WMNs) have emerged as a promising concept to meet the
challenges in next-generation networks such as providing flexible, adaptive,
and reconfigurable architecture while offering cost-effective solutions to the
service providers. Unlike traditional Wi-Fi networks, with each access point
(AP) connected to the wired network, in WMNs only a subset of the APs are
required to be connected to the wired network. The APs that are connected to
the wired network are called the Internet gateways (IGWs), while the APs that
do not have wired connections are called the mesh routers (MRs). The MRs are
connected to the IGWs using multi-hop communication. The IGWs provide access to
conventional clients and interconnect ad hoc, sensor, cellular, and other
networks to the Internet. However, most of the existing routing protocols for
WMNs are extensions of protocols originally designed for mobile ad hoc networks
(MANETs) and thus they perform sub-optimally. Moreover, most routing protocols
for WMNs are designed without security issues in mind, where the nodes are all
assumed to be honest. In practical deployment scenarios, this assumption does
not hold. This chapter provides a comprehensive overview of security issues in
WMNs and then particularly focuses on secure routing in these networks. First,
it identifies security vulnerabilities in the medium access control (MAC) and
the network layers. Various possibilities of compromising data confidentiality,
data integrity, replay attacks and offline cryptanalysis are also discussed.
Then various types of attacks in the MAC and the network layers are discussed.
After enumerating the various types of attacks on the MAC and the network
layer, the chapter briefly discusses on some of the preventive mechanisms for
these attacks.Comment: 44 pages, 17 figures, 5 table
PluralisMAC: a generic multi-MAC framework for heterogeneous, multiservice wireless networks, applied to smart containers
Developing energy-efficient MAC protocols for lightweight wireless systems has been a challenging task for decades because of the specific requirements of various applications and the varying environments in which wireless systems are deployed. Many MAC protocols for wireless networks have been proposed, often custom-made for a specific application. It is clear that one MAC does not fit all the requirements. So, how should a MAC layer deal with an application that has several modes (each with different requirements) or with the deployment of another application during the lifetime of the system? Especially in a mobile wireless system, like Smart Monitoring of Containers, we cannot know in advance the application state (empty container versus stuffed container). Dynamic switching between different energy-efficient MAC strategies is needed. Our architecture, called PluralisMAC, contains a generic multi-MAC framework and a generic neighbour monitoring and filtering framework. To validate the real-world feasibility of our architecture, we have implemented it in TinyOS and have done experiments on the TMote Sky nodes in the w-iLab.t testbed. Experimental results show that dynamic switching between MAC strategies is possible with minimal receive chain overhead, while meeting the various application requirements (reliability and low-energy consumption)
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
- …