Two Energy Efficient Algorithms for Tracking Objects in a Sensor Network

We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount of data being shipped across the network. Hence, it locates the objects over the network with minimal energy conservation using short-range message transmissions. The performance analysis (both experimental and theoretical) shows the effectiveness of the two algorithms in comparison to another tracking algorithm

Spectrum and Energy Efficient Medium Access Control for Wireless Ad Hoc Networks

The increasingly growing number of mobile devices and volume of mobile data traffic necessitate establishing an effective self-organizing wireless ad hoc network to efficiently utilize radio spectrum and energy. The transmissions time and bandwidth should be dynamically coordinated based on instantaneous traffic load of the links in the network. Energy consumption in a mobile device can be reduced by putting the radio interface into a sleep mode. However, the mobile device cannot receive incoming data packets in the sleep mode. Thus, awake and sleep times of radio interfaces should be carefully planned to avoid missing incoming packets. In a wireless network, links that are far apart in distance can simultaneously transmit using the same bandwidth without interfering reception at destination nodes. Concurrent transmissions should be properly scheduled to maximize spatial spectrum utilization. Also, the transmission power level of each link should be optimized to enhance spectrum and energy efficiencies. First, we present a new energy-efficient medium access control (MAC) scheme for a fully connected wireless ad hoc network. Energy consumption is reduced by periodically putting radio interfaces in the sleep mode and by reducing transmission collisions. The network throughput and average packet transmission delay are also improved because of lower collision and contention overhead. The proposed MAC scheme can achieve energy saving for realtime traffic which requires a low packet transmission delay. An analytical model is established to evaluate the performance of the proposed MAC scheme. Analytical and simulation results demonstrate that the proposed scheme has a significantly lower energy consumption, achieves higher throughput, and has a lower packet transmission delay in comparison with existing power saving MAC protocols. Second, we present a novel distributed MAC scheme based on dynamic space-reservation to effectively coordinate transmissions in a wireless ad hoc network. A set of coordinator nodes distributed over the network area are employed to collect and exchange local network information and to periodically schedule links for transmission in a distributed manner. For each scheduled transmission, a proper space area around the receiver node is reserved to enhance spatial spectrum reuse. Also, the data transmission times are deterministic to minimize idle-listening radio interface energy consumption. Simulation results demonstrate that the proposed scheme achieves substantially higher throughput and has significantly lower energy consumption in comparison with existing schemes. We study joint scheduling and transmission power control in a wireless ad hoc network. We analyze the asymptotic joint optimal scheduling and transmission power control, and determine the maximum spectrum and energy efficiencies in a wireless network. Based on the asymptotic analysis, we propose a novel scheduling and transmission power control scheme to approach the maximum spectrum efficiency, subject to an energy consumption constraint. Simulation results show that the proposed distributed scheme achieves 40% higher throughput than existing schemes. Indeed, the scheduling efficiency of our proposed scheme is about 70% of the asymptotic optimal scheduling and transmission power control. Also, the energy consumption of the proposed scheme is about 20% of the energy consumed using existing MAC protocols. The proposed MAC, scheduling and transmission power control schemes provide effective spectrum sharing and energy management for future wireless hotspot and peer-to-peer communication networks. The presented asymptotic analysis determines the maximum spectrum and energy efficiencies in a wireless network and provides an effective means to efficiently utilize spectrum and energy resources based on network traffic load and energy consumption constrains

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

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

Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks

Soaring capacity and coverage demands dictate that future cellular networks need to soon migrate towards ultra-dense networks. However, network densification comes with a host of challenges that include compromised energy efficiency, complex interference management, cumbersome mobility management, burdensome signaling overheads and higher backhaul costs. Interestingly, most of the problems, that beleaguer network densification, stem from legacy networks' one common feature i.e., tight coupling between the control and data planes regardless of their degree of heterogeneity and cell density. Consequently, in wake of 5G, control and data planes separation architecture (SARC) has recently been conceived as a promising paradigm that has potential to address most of aforementioned challenges. In this article, we review various proposals that have been presented in literature so far to enable SARC. More specifically, we analyze how and to what degree various SARC proposals address the four main challenges in network densification namely: energy efficiency, system level capacity maximization, interference management and mobility management. We then focus on two salient features of future cellular networks that have not yet been adapted in legacy networks at wide scale and thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and device-to-device (D2D) communications. After providing necessary background on CoMP and D2D, we analyze how SARC can particularly act as a major enabler for CoMP and D2D in context of 5G. This article thus serves as both a tutorial as well as an up to date survey on SARC, CoMP and D2D. Most importantly, the article provides an extensive outlook of challenges and opportunities that lie at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201

Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis