oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Energy Aware GPSR Routing Protocol in a Wireless Sensor Network
S Nouh, Z Geta
Zede Journal , 2011,
Abstract: Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their energy consumption. The proposed solution is based on incorporating energy information into Greedy Perimeter Stateless Routing (GPSR) Protocol. The proposed solution performs better in energy consumption, network lifetime and packet delivery ratio, with a performance gain of Network Lifetime 45.9% - 78.69%. However, the performance is comparatively low in average delay because of computational complexity. Key Words: Wireless Sensor Networks, GPSR protocol, Geographical routing protocol, `Energy aware routing protocol
Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks  [PDF]
Amir Hossein Mohajerzadeh, Mohammad Hossien Yaghmaee
Wireless Sensor Network (WSN) , 2010, DOI: 10.4236/wsn.2010.22021
Abstract: Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc; of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.
SCARP: Secure Congestion Aware Routing Protocol for Wireless Sensor Networks  [PDF]
Ch.Radhika Rani,S.Nagendram,Subba Reddy Oota
International Journal on Computer Science and Engineering , 2011,
Abstract: Wireless sensor networks sense various kinds of information, process them locally and communicate it to the outside world via satellite or Internet. In the near future, sensor networks will play a major role in collecting and disseminating information from the fields where ordinary networks are unreachable for various environmental and strategical reasons. Hence it is increasingly likely that sensorswill be shared by multiple applications and gather heterogeneous data of different priorities. With such concentration on wireless sensor networks, vital issues like security and congestion control are to be taken care of. We propose Secure Congestion Aware Routing protocol (SCARP), a protocol designed for mitigating congestion by dedicating a portion of network to forward high-priority traffic primarily andalso satisfies the major security properties like data authentication, data secrecy, replay protection, freshness with low energy consumption which are the major factors affecting the wireless sensor networks.
Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks  [cached]
Mann Raminder P,Namuduri Kamesh R,Pendse Ravi
EURASIP Journal on Wireless Communications and Networking , 2005,
Abstract: Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP) suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.
Mitigating Congestion Aware Routing Protocol in Wireless Sensor Networks
B. Pruthvi raj, O.Srinivasa Rao#2, Dr MHM Krishna Prasad*3
International Journal of Computer Trends and Technology , 2011,
Abstract: - Energy efficient protocol is very important in wireless Sensor Networks (WSNs) because the nodes in WSNs are usually battery operated sensing devices with limited energy resources and replacing the batteries is usually not an option. We propose a class of algorithms that enforce differentiated routing based on the congested areas of a network and data priority. The basic protocol, called Congestion-Aware Routing (CAR), discovers the congested zone of the network that exists between highpriority data sources and the data sink and, using simple forwarding rules, dedicates this portion of the network to forwarding primarily high-priority traffic. Since CAR requires some overhead for establishing the high-priority routing zone, it is unsuitable for highly mobile data sources. Congestion occurrence in network nodes leads to increase packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. To overcome these issues, an Index Base Congestion aware Routing Protocol (ICRP) proposed. The proposed protocol is energy efficient routing protocols which try to control congestion and to provide fairness in network. The main goal in ICRP provides solution for better energy utilization of a node and better Quality of Services (QoS).
A Delay Aware Routing Protocol for Wireless Sensor Networks  [PDF]
Bhaskar Bhuyan,Nityananda Sarma
Computer Science , 2015,
Abstract: Wireless Sensor Networks (WSNs) consist of sensor nodes which can be deployed for various operations such as agriculture and environmental sensing, wild life monitoring, health care, military surveillance, industrial control, home automation, security etc. Quality of Service (QoS) is an important issue in wireless sensor networks (WSNs) and providing QoS support in WSNs is an emerging area of research. Due to resource constraints nature of sensor networks like processing power, memory, bandwidth, energy etc. providing QoS support in WSNs is a challenging task. Delay is an important QoS parameter for forwarding data in a time constraint WSNs environment. In this paper we propose a delay aware routing protocol for transmission of time critical event information to the Sink of WSNs. The performance of the proposed protocol is evaluated by NS2 simulations under different scenarios.
An Indexed based Congestion Aware Routing Protocol for Wireless Sensor Networks  [PDF]
S.Janarathanan,M.Kumaran,V.Seedha Devi,,V.Balaji Vijayan
International Journal of Computer Technology and Applications , 2011,
Abstract: Energy efficient protocol is very important in wireless Sensor Networks (WSNs) because the nodes in WSNs are usually battery operated sensing devices with limited energy resources and replacing the batteries is usually not an option. Thus energy efficiency is one of the most important issues in WSNs. Routing protocols which only consider energy as their parameter is not efficient. In addition to energy efficiency, using other parameters makes routing protocol more efficient. For different applications, different parameters should be considered. One of the most important parameter is congestion management. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increase packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. To overcome these issues, an Index Base Congestion aware Routing Protocol (ICRP) proposed. The proposed protocol is energy efficient routing protocols which try to control congestion and to provide fairness in network. The main goal in ICRP provides solution for better energy utilization of a node and better Quality of Services (QoS).
Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks  [PDF]
Bhaskar Bhuyan, Nityananda Sarma
Communications and Network (CN) , 2016, DOI: 10.4236/cn.2016.81006
Abstract: Quality of Service (QoS) in Wireless Sensor Networks (WSNs) is a challenging area of research because of the limited availability of resources in WSNs. The resources in WSNs are processing power, memory, bandwidth, energy, communication capacity, etc. Delay is an important QoS parameter for delivery of delay sensitive data in a time constraint sensor network environment. In this paper, an extended version of a delay aware routing protocol for WSNs is presented along with its performance comparison with different deployment scenarios of sensor nodes, taking IEEE802.15.4 as the underlying MAC protocol. The performance evaluation of the protocol is done by simulation using ns-2 simulator.
An Energy-Aware Routing Protocol in Wireless Sensor Networks  [PDF]
Ming Liu,Jiannong Cao,Guihai Chen,Xiaomin Wang
Sensors , 2009, DOI: 10.3390/s90100445
Abstract: The most important issue that must be solved in designing a data gathering algorithm for wireless sensor networks (WSNS) is how to save sensor node energy while meeting the needs of applications/users. In this paper, we propose a novel energy-aware routing protocol (EAP) for a long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all the nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely, intra-cluster coverage to cope with the area coverage problem. We use a simple temperature sensing application to evaluate the performance of EAP and results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.
FEAR: A FUZZY-BASED ENERGY-AWARE ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS  [PDF]
Ehsan Ahvar,Alireza Pourmoslemi,Mohammad Jalil Piran
International Journal of Grid Computing & Applications , 2011,
Abstract: Many energy-aware routing protocols have been proposed for wireless sensor networks. Most of them are only energy savers and do not take care about energy balancing. The energy saver protocols try to decrease the energy consumption of the network as a whole; however the energy manager protocols balance the energy consumption in the network to avoid network partitioning. This means that energy saver protocols are not necessarily energy balancing and vice versa. However, the lifetime of wireless sensor network is strictly depending on energy consumption; therefore, energy management is an essential task to be considered. This paper proposes an energy aware routing protocol, named FEAR, which considers energy balancing and energy saving. It finds a fair trade-off between energy balancing and energy saving by fuzzy set concept. FEAR routing protocol is simulated and evaluated by Glomosim simulator.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.