Performance Comparison of Contention- and Schedule-based MAC Protocols in Urban Parking Sensor Networks

Network traffic model is a critical problem for urban applications, mainly because of its diversity and node density. As wireless sensor network is highly concerned with the development of smart cities, careful consideration to traffic model helps choose appropriate protocols and adapt network parameters to reach best performances on energy-latency tradeoffs. In this paper, we compare the performance of two off-the-shelf medium access control protocols on two different kinds of traffic models, and then evaluate their application-end information delay and energy consumption while varying traffic parameters and network density. From the simulation results, we highlight some limits induced by network density and occurrence frequency of event-driven applications. When it comes to realtime urban services, a protocol selection shall be taken into account - even dynamically - with a special attention to energy-delay tradeoff. To this end, we provide several insights on parking sensor networks.Comment: ACM International Workshop on Wireless and Mobile Technologies for Smart Cities (WiMobCity) (2014

A New Protocol for Cooperative Spectrum Sharing in Mobile Cognitive Radio Networks

To optimize the usage of limited spectrum resources, cognitive radio (CR) can be used as a viable solution. The main contribution of this article is to propose a new protocol to increase throughput of mobile cooperative CR networks (CRNs). The key challenge in a CRN is how the nodes cooperate to access the channel in order to maximize the CRN's throughput. To minimize unnecessary blocking of CR transmission, we propose a so-called new frequency-range MAC protocol (NFRMAC). The proposed method is in fact a novel channel assignment mechanism that exploits the dependence between signal's attenuation model, signal's frequency, communication range, and interference level. Compared .to the conventional methods, the proposed algorithm considers a more realistic model for the mobility pattern of CR nodes and also adaptively selects the maximal transmission range of each node over which reliable transmission is possible. Simulation results indicate that using NFRMAC leads to an increase of the total CRN's throughput by 6% and reduces the blocking rate by 10% compared to those of conventional methods

An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Network

Wireless sensor networks are networks of tiny sensing devices for communicating in using wireless technology. Wireless sensor networks are deployed in scenarios where any plant information should be available for industrial control applications. Cross-layer interaction is most important factor to gain maximum efficiency and also able to provide difficult interaction among the layers of the protocol stack. Hence to achieve this is challenging issue because latency, energy and reliability are at odds, and also resource constrained does not support complex algorithm. Wireless sensor networks have many protocols. In this paper Breath protocol is proposed for industrial control application .To minimizing energy consumption in network breath is designed for WSNs by which nodes attached to plants must carry information via through multi hop routing to sink. To optimize energy efficiency the protocol is based on randomized routing, medium access control, and duty-cycling. Alternate model of breath protocol ensures a long lifetime of the network by making effective distribution of workload in sensor nodes. Hence it shows as a good terminology for efficient, timely data gathering for industrial control applications. DOI: 10.17762/ijritcc2321-8169.15032

Energy Harvesting Wireless Communications: A Review of Recent Advances

This article summarizes recent contributions in the broad area of energy harvesting wireless communications. In particular, we provide the current state of the art for wireless networks composed of energy harvesting nodes, starting from the information-theoretic performance limits to transmission scheduling policies and resource allocation, medium access and networking issues. The emerging related area of energy transfer for self-sustaining energy harvesting wireless networks is considered in detail covering both energy cooperation aspects and simultaneous energy and information transfer. Various potential models with energy harvesting nodes at different network scales are reviewed as well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications (Special Issue: Wireless Communications Powered by Energy Harvesting and Wireless Energy Transfer

Energy Efficient and Secure Wireless Sensor Networks Design

Wireless Sensor Networks (WSNs) are emerging technologies that have the ability to sense, process, communicate, and transmit information to a destination, and they are expected to have significant impact on the efficiency of many applications in various fields. The resource constraint such as limited battery power, is the greatest challenge in WSNs design as it affects the lifetime and performance of the network. An energy efficient, secure, and trustworthy system is vital when a WSN involves highly sensitive information. Thus, it is critical to design mechanisms that are energy efficient and secure while at the same time maintaining the desired level of quality of service. Inspired by these challenges, this dissertation is dedicated to exploiting optimization and game theoretic approaches/solutions to handle several important issues in WSN communication, including energy efficiency, latency, congestion, dynamic traffic load, and security. We present several novel mechanisms to improve the security and energy efficiency of WSNs. Two new schemes are proposed for the network layer stack to achieve the following: (a) to enhance energy efficiency through optimized sleep intervals, that also considers the underlying dynamic traffic load and (b) to develop the routing protocol in order to handle wasted energy, congestion, and clustering. We also propose efficient routing and energy-efficient clustering algorithms based on optimization and game theory. Furthermore, we propose a dynamic game theoretic framework (i.e., hyper defense) to analyze the interactions between attacker and defender as a non-cooperative security game that considers the resource limitation. All the proposed schemes are validated by extensive experimental analyses, obtained by running simulations depicting various situations in WSNs in order to represent real-world scenarios as realistically as possible. The results show that the proposed schemes achieve high performance in different terms, such as network lifetime, compared with the state-of-the-art schemes

Outdoor Air Quality Monitoring with Enhanced Lifetime-enhancing Cooperative Data Gathering and Relaying Algorithm (E-LCDGRA) Based Sensor Network

The air continues to be an extremely substantial part of survival on earth. Air pollution poses a critical risk to humans and the environment. Using sensor-based structures, we can get air pollutant data in real-time. However, the sensors rely upon limited-battery sources that are immaterial to be alternated repeatedly amid extensive broadcast costs associated with real-time applications like air quality monitoring. Consequently, air quality sensor-based monitoring structures are lifetime-constrained and prone to the untimely loss of connectivity. Effective energy administration measures must therefore be implemented to handle the outlay of power dissipation. In this study, the authors propose outdoor air quality monitoring using a sensor network with an enhanced lifetime-enhancing cooperative data gathering and relaying algorithm (E-LCDGRA). LCDGRA is a cluster-based cooperative event-driven routing scheme with dedicated relay allocation mechanisms that tackle the problems of event-driven clustered WSNs with immobile gateways. The adapted variant, named E-LCDGRA, enhances the LCDGRA algorithm by incorporating a non-beaconaided CSMA layer-2 un-slotted protocol with a back-off mechanism. The performance of the proposed E-LCDGRA is examined with other classical gathering schemes, including IEESEP and CERP, in terms of average lifetime, energy consumption, and dela

Review Paper Opportunistics Routing Protocol For Performance Enhancement In Wsn

In Remote Sensor Network, sensor hub are sent in application territory to shape organize. Data about the physical and synthetic marvel are gathered by sensor hub and exchange to the sink hub for additionally preparing. Sharp Routing convention is required to fulfill the errand of exchanging data. Opportunistic routing is used for wireless multi-hop network .The main features of Opportunistic routing is coordination and selection of forwarding node to transfer the packets to the sink node. Opportunistic routing enables the multiple paths and dynamics the relay selection in wireless multihop networks with higher node density .In order to enhance the performance of relay node Opportunistic routing collaborates all the sensor nodes in the path while forwarding the data packets

An Information Management Protocol to Control Routing and Clustering in Sensor Networks

In this paper, we develop and analyze a novel clustering protocol, Decentralized Energy Efficient cluster Propagation (DEEP), that attempts to manage the communication of data while minimizing energy consumption across the sensor networks. We also develop an Inter-Cluster Routing protocol (ICR) that is compatible with the proposed clustering technique. DEEP takes advantage of the multi-rate capabilities of 802.11a, b, g technologies by elevating the data rate to higher levels for shorter transmission ranges. This approach reduces the energy consumption by lowering the transmission time. Protocol DEEP starts with an initial cluster head and gradually forms clusters throughout the network by controlling the geographical dimensions of clusters and distribution of cluster heads in order to conserve energy and prolong network lifetime. Furthermore, due to the balanced load, protocol overhead caused by unnecessary frequent re-clustering is eradicated. Our simulation results demonstrate that DEEP distributes energy consumption approximately 8 times better than an existing clustering scheme, LEACH. In addition, DEEP substantially reduces total data communication and route setup energy consumption in the network compared to LEACH