A Study on Sanctuary and Seclusion Issues in Internet-of-Things

Internet-of-Things (IoT) are everywhere in our daily life. They are used in our homes, in hospitals, deployed outside to control and report the changes in environment, prevent fires, and many more beneficial functionality. However, all those benefits can come of huge risks of seclusion loss and sanctuary issues. To secure the IoT devices, many research works have been con-ducted to countermeasure those problems and find a better way to eliminate those risks, or at least minimize their effects on the user�s seclusion and sanctuary requirements. The study consists of four segments. The first segment will explore the most relevant limitations of IoT devices and their solutions. The second one will present the classification of IoT attacks. The next segment will focus on the mechanisms and architectures for authentication and access control. The last segment will analyze the sanctuary issues in different layers

SCOPE: Synergistic Content Distribution and Peer-to-Peer Networks

Distributing content on the Internet is an important economic, educational, social, and cultural endeavor. To this end, several existing efforts use traditional server-based content distribution networks (CDNs) to replicate and distribute Web and multimedia content of big content producers, such as news Web sites, or big businesses, such as online shopping websites, etc., to millions of Internet users. This approach places a large number of content servers at strategic locations on the Internet, incurring a very large deployment and operating cost. Therefore, it is available only to some wealthy companies/organizations. Individual users and small content publishers may rely on a more economical content dissemination approach based on recent peer-to-peer technology to distribute their own content. Nevertheless, it is the ephemeral and the limited resources nature of peer-to-peer networks that hinder a wide spread adoption of peer-to-peer technology as a reliable content distribution solution. It is, therefore, important that a new generation of cost-effective and reliable content distribution framework be proposed and investigated. Building on the successes and failures of previous content distribution approaches, the proposed research goal is to find and evaluate a Synergistic Content Distribution and Peer-to-Peer Networks (SCOPE). SCOPE leverages the reliability and the resourcefulness of traditional server-based CDNs while tapping on the economical and dynamic resources of peers

An Overview of Own Tracking Wireless Sensors with GSM-GPS Features

Wireless Sensors (WS) mobility and pause time have a major impact directly influencing the energy consumption. Lifetime of a WS Network (WSN) depends directly on the energy consumption, thus, the hardware and software components must be optimized for energy management. This study aims to combine a compact hardware architecture with a smart energy management efficiency in order to increase ratio Lifetime/Energy Consumption, to improve the operating time on a portable tracking system with GPS/GSM/GPRS features and own power. In this paper we present the evolution of own WS tracking architecture with GPS/GSM/GPRS features, basic criterion being the lifetime combined with low power consumption. Concern was focused on hardware and software areas: Large number of physical components led to reconsideration of hardware architecture, while for software, we focused on algorithms able to reduce the number of bits in transmitted data packets, which help to reduce energy consumption. The results and conclusions show that the goal was achieved

GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks

The routing process in a Mobile Ad Hoc Network (MANET) poses critical challenges because of its features such as frequent topology changes and resource limitations. Hence, designing a reliable and dynamic routing protocol that satisfies MANET requirements is highly demanded. The Greedy Forwarding Strategy (GFS) has been the most used strategy in position-based routing protocols. The GFS algorithm was designed as a high-performance protocol that adopts hop count in soliciting shortest path. However, the GFS does not consider MANET needs and is therefore insufficient in computing reliable routes. Hence, this study aims to improve the existing GFS by transforming it into a dynamic stand-alone routing protocol that responds swiftly to MANET needs, and provides reliable routes among the communicating nodes. To achieve the aim, two mechanisms were proposed as extensions to the current GFS, namely the Dynamic Beaconing Updates Mechanism (DBUM) and the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism (DRESM). The DBUM algorithm is mainly responsible for providing a node with up-to-date status information about its neighbours. The DRESM algorithm is responsible for making forwarding decisions based on multiple routing metrics. Both mechanisms were integrated into the conventional GFS to form Greedy Stand-Alone Routing (GSAR) protocol. Evaluations of GSAR were performed using network simulator Ns2 based upon a defined set of performance metrics, scenarios and topologies. The results demonstrate that GSAR eliminates recovery mode mechanism in GFS and consequently improve overall network performance. Under various mobility conditions, GSAR avoids hole problem by about 87% and 79% over Greedy Perimeter Stateless Routing and Position-based Opportunistic Routing Protocol respectively. Therefore, the GSAR protocol is a reasonable alternative to position-based unicast routing protocol in MANET

Geographic Routing with Partial Position Information

International audienceGeographic routing protocols show good properties for Wireless Sensor Networks (WSN). They are stateless, local and scalable. However they require that each node of the network is aware of its own position. While it may be possible to equip each node with GPS receiver, even if it is costly, there are some issues and receiving a usable GPS signal may be difficult in some situations. For these reasons, we propose a geographic routing algorithm, called HGA, able to take advantages of position informations of nodes when available but also able to continue the routing in a more traditional way if position information is not available. We show with simulations that our algorithm offers an alternative solution to classical routing algorithm (non-geographic) and offers better performances for network with a density above 25 and more than 5% of nodes are aware of their position

Attack DistributionModeling and Its Applications in Sensor Network Security

Defending against attack is the key successful factor for sensor network security. There are many approaches that can be used to detect and defend against attacks, yet few are focused onmodeling attack distribution. Knowing the distribution models of attacks can help system estimate the attack probability and thus defend against them effectively and efficiently. In this paper, we use probability theory to develop a basic uniform model, a basic gradient model, an intelligent uniform model and an intelligent gradient model of attack distribution in order to adapt to different application environments. These models allow systems to estimate the attack probability of each node under a given position and time. Applying these models in system security designs can improve system security performance and decrease the overheads in nearly every security area. Based on these models, we describe a novel probability secure routing algorithm that is effective to defend against attacks whether they are detected or not. Besides this application, we also introduce some other applications, such as secure routing that can save systems available energy and resources while still providing enough security, detecting attack, and key management

Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete

We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The Gabriel edges of a unit disc graph induce a planar O(\sqrt{n}) distance and an optimal energy spanner. This is one of the most interesting restrictions of Metric Dimension in the context of wireless multi-hop networks.Comment: A brief announcement of this result has been published in the proceedings of ALGOSENSORS 201

A survey of network lifetime maximization techniques in wireless sensor networks

Emerging technologies, such as the Internet of things, smart applications, smart grids and machine-to-machine networks stimulate the deployment of autonomous, selfconfiguring, large-scale wireless sensor networks (WSNs). Efficient energy utilization is crucially important in order to maintain a fully operational network for the longest period of time possible. Therefore, network lifetime (NL) maximization techniques have attracted a lot of research attention owing to their importance in terms of extending the flawless operation of battery-constrained WSNs. In this paper, we review the recent developments in WSNs, including their applications, design constraints and lifetime estimation models. Commencing with the portrayal of rich variety definitions of NL design objective used for WSNs, the family of NL maximization techniques is introduced and some design guidelines with examples are provided to show the potential improvements of the different design criteri