Secure Data Collection Using Randomized Multipath Routing

Wireless Sensor Networks (WSNs) are widely used in various real time applications such as surveillance, environment monitoring, studying wildlife habitat and so on. As the nodes in the network are resource constrained, they are vulnerable to various attacks. This is the reason there is need for secure data collection in such networks. Many solutions came into existence to provide secure communications in WSN. However, the solutions were based on different techniques. Minimization of packet failure rate is one of the objectives of many researchers in this area. The potential attacks on the network can jeopardise its purpose. Recently Alghamdi et al. proposed a solution using multipath routing in which the effect of adversaries is reduced besides ensuring secure data transmission in the presence of malicious nodes in the network. Our work is similar to this with certain improvements in terms of energy consumption and also packet delivery failure ratio. We implemented a WSN with simulations and our approach used a controller in the network which, in consultation with base station, can play a vital role in prevention of attacks. Since the solution is based on randomized multipath routing, it is able to withstand potential attacks and ensure that the failure of packet delivery is minimized and the overall network performance is improved. The simulation results reveal that the proposed approach has better performance in terms of performance level of protocol, network throughput, delay analysis, percentage of packet loss, and energy consumption. DOI: 10.17762/ijritcc2321-8169.150713

Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both intra- and inter-path interference. The proposed scheme is evaluated through NS-2 simulations. Our preliminary results are derived from a grid topology and show that the proposed flow allocation scheme slightly underestimates the average aggregate throughput observed in two simulated scenarios with two and three flows respectively. Moreover it achieves significantly higher average aggregate throughput than single path utilization in two different traffic scenarios examined.Comment: Accepted for publication at the 9th IEEE BROADBAND WIRELESS ACCESS WORKSHOP (BWA2013), IEEE Globecom 2013 Workshop

MAXIMIZE THE LIFETIME OF SENSOR NETWORK BY LOAD BALANCING USING TREE TOPOLOGY

In many wireless sensor networks due to the limited energy of sensor nodes energy conservation is one of the most important challenges. To enhance the lifetime of the network emphasis is given to design energy efficient routing algorithms. In WSN, sensor nodes which are nearer to the base station having a task of collecting data for the entire area and send to the base station. This node has an additional load and depletes its energy faster. This paper addresses the problem of lifetime maximization by load balancing. This paper proposes energy efficient load balanced data collection algorithm considering different network parameter (e.g., density, degree). In this method, Data collection tree topology is built at the sink node. Performance of the proposed algorithm is evaluated by considering various parameters like topology, availability of resources and the energy utilization of nodes in different paths of the tree, which may vary and ultimately impacts the overall network lifetime. Sensor nodes are switched from their original path to other based on the load and it reduces communication overhead

MEGOR: Multi-constrained Energy efficient Geographic Opportunistic Routing in Wireless Sensor Network

Providing better energy efficient network is the important critical issues in Wireless Sensor Networks. We presented Multi-constrained Energy efficient Geographic Opportunistic Routing algorithm that enhance the network lifetime based on efficient Geographic Opportunistic Routing. Geographic Opportunistic Routing algorithm uses single path multi hop routing technique in which packets are effectively routed from source to the sink node in a given geographical region. Proposed algorithm is devised with unique parameters viz., Single hop Packet Progress, Packet Reception Ratio, Residual Energy and Energy Density to select intermediate next nodes to forward the packet to sink node. The MEGOR exhibits better results in terms of delay, reliability, energy efficiency and network lifetime when compared with earlier state_of_art works

Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding problem is non-convex. Furthermore, a simple, but accurate model is employed for the average aggregate throughput achieved by all flows, that captures both intra- and inter-path interference through the SINR model. The proposed scheme is evaluated through Ns2 simulations of several random wireless scenarios. Simulation results reveal that, the model employed, accurately captures the AAT observed in the simulated scenarios, even when the assumption of saturated queues is removed. Simulation results also show that the proposed scheme achieves significantly higher AAT, for the vast majority of the wireless scenarios explored, than the following flow allocation schemes: one that assigns flows on paths on a round-robin fashion, one that optimally utilizes the best path only, and another one that assigns the maximum possible flow on each path. Finally, a variant of the proposed scheme is explored, where interference for each link is approximated by considering its dominant interfering nodes only.Comment: IEEE Transactions on Vehicular Technolog

Enabling Hardware Green Internet of Things: A review of Substantial Issues

Between now and the near future, the Internet of Things (IoT) will redesign the socio-ecological morphology of the human terrain. The IoT ecosystem deploys diverse sensor platforms connecting millions of heterogeneous objects through the Internet. Irrespective of sensor functionality, most sensors are low energy consumption devices and are designed to transmit sporadically or continuously. However, when we consider the millions of connected sensors powering various user applications, their energy efficiency (EE) becomes a critical issue. Therefore, the importance of EE in IoT technology, as well as the development of EE solutions for sustainable IoT technology, cannot be overemphasised. Propelled by this need, EE proposals are expected to address the EE issues in the IoT context. Consequently, many developments continue to emerge, and the need to highlight them to provide clear insights to researchers on eco-sustainable and green IoT technologies becomes a crucial task. To pursue a clear vision of green IoT, this study aims to present the current state-of-the art insights into energy saving practices and strategies on green IoT. The major contribution of this study includes reviews and discussions of substantial issues in the enabling of hardware green IoT, such as green machine to machine, green wireless sensor networks, green radio frequency identification, green microcontroller units, integrated circuits and processors. This review will contribute significantly towards the future implementation of green and eco-sustainable IoT

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks