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
An Energy Equilibrium Routing Algorithm Based on Cluster-head Prediction for Wireless Sensor Networks  [PDF]
Lejiang Guo,Bingwen Wang,Zhuo Liu,Wei Wang
Information Technology Journal , 2010,
Abstract: Because of the limited energy in wireless sensor networks, the research on routing technology on the network layer is pivotal in the architecture of wireless sensor networks. Aiming at the defect problem of the clustering network, this study presents an energy equilibrium routing algorithm based on Cluster-head Prediction for Wireless Sensor Networks (CP-EERP). The algorithm uses the cluster-head prediction mechanism which improves cluster-head lifetime, balances the energy between nodes and prolongs the network lifetime. CP-EERP includes network initialization phase, cluster building phase, data transmission phase and cluster-head prediction phase. The simulation result shows that the algorithm performs better, in terms of power efficiency and the number of communication neighbors, than the classic routing algorithm.
Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network  [PDF]
Md. Golam Rashed,M. Hasnat Kabir,Muhammad Sajjadur Rahim,Shaikh Enayet Ullah
Computer Science , 2012,
Abstract: The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that this protocol reduces energy consumption quite significantly and prolongs the life time of sensor network as compared to LEACH.
Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network  [cached]
Boseung Kim,HuiBin Lim,Yongtae Shin
International Journal of Computer Science and Information Security , 2009,
Abstract: Wireless Sensor Networks is important to node’s energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor network’s routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy-efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy consumption of sensor nodes by forming cluster and communicating with cluster head. but though hierarchical routing technique based on clustering is advantage more than flat routing technique, this is not used for reason that is not realistic. The reason that is not realistic is because hierarchical routing technique does not consider data transmission radius of sensor node in actually. so this paper propose realistic routing technique base on clustering.
Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network  [PDF]
Boseung Kim,Huibin Lim,Yongtae Shin
Computer Science , 2009,
Abstract: Wireless Sensor Networks is important to nodes energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor networks routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy consumption of sensor nodes by forming cluster and communicating with cluster head. but though hierarchical routing technique based on clustering is advantage more than flat routing technique, this is not used for reason that is not realistic. The reason that is not realistic is because hierarchical routing technique does not consider data transmission radius of sensor node in actually. so this paper propose realistic routing technique base on clustering.
Hybrid Cluster-based Routing Protocol in Wireless Sensor Networks
基于混合分簇的无线传感器网络路由协议

LI Jie CHEN Zhi-guo LI Zhi-yuan,
李捷
,陈志国,李致远

计算机科学 , 2008,
Abstract: With the application of large-scale Wireless Sensor Networks(WSNs) in recent years,how to further prolong the lifetime of sensors network is a challenge to the research of routing protocol.In this paper,an energy-efficient hybrid clustering routing protocol(EEHCRP) for wireless sensor networks was proposed.The algorithm integrated the advantages of concentrated clustering and distributed clustering.It could make the distribution of cluster head more evenly,and reduce the overhead of cluster reconstruction.O...
Distributed Energy-Economical Routing Algorithm Based on Game-Theory for WSN
基于博弈理论的无线传感器网络分布式节能路由算法

Yang Ning,Tian Hui,Huang Ping,Zhang Ping,
杨宁
,田辉,黄平,张平

电子与信息学报 , 2008,
Abstract: In order to efficiently solve the energy problem of routing, the game-theory is borrowed and an energy efficient routing algorithm is proposed. Based on the research of game model and other routing schemes for wireless sensor networks, the Distributed Energy-Economical Routing (DEER) is designed to save the energy of the whole network through paying attention to both remained energy and the distribution of head nodes. The simulation results prove that this scheme can effectively balance the load and prolong the life of the wireless sensor networks.
Timeserving Routing Protocol Implementation to accomplish best throughput and fairness  [cached]
Narasimha Rao V L Potta,B. Sarath Kumar
International Journal of Computer & Electronics Research , 2012,
Abstract: The latest technology for next generation Wireless networking is Wireless Mesh Networks (WMNs), with low cost and easy deploying. The WMNs are desirable for communication paradigm. The WMNs are more advantageous over other wireless networks. The existing routing protocols which transmits the traffic through pre-determined path which don’t provide security. This paper proposes a routing protocol called simplistic constructive routing protocol (SPRP) which supports multiple flows in wireless mesh networks. There are four major components in the SPRP which provides fairness and high throughput: 1) To minimize the multiple data transmissions Constructive forwarding path selection to provide multiple paths while minimizing duplicate transmissions, 2) Constructive rate control to determine an appropriate transfer rate according to the current network conditions. 3) Inter node loss recovery to efficiently find and resend lost packets, and 4) clock-based forwarding to let only the priority node to forward the traffic. Our result shows that SPRP significantly performs existing routing and a pivotal time serving routing protocol.
Distance based (DBCP) Cluster Protocol for Heterogeneous Wireless Sensor Network  [PDF]
Surender Kumar,Manish Prateek,Bharat Bhushan
Computer Science , 2014, DOI: 10.5120/13278-0877
Abstract: Clustering is an important concept to reduce the energy consumption and prolonging the life of a wireless sensor network. In heterogeneous wireless sensor network some of the nodes are equipped with more energy than the other nodes. Many routing algorithms are proposed for heterogeneous wireless sensor network. Stable Election Protocol (SEP) is one of the important protocol in this category. In this research paper a novel energy efficient distance based cluster protocol (DBCP) is proposed for single hop heterogeneous wireless sensor network to increase the life and energy efficiency of a sensor network. DBCP use the average distance of the sensor from the base station as the major issue for the selection of a cluster head in the sensor network.
Cluster-Based Routing Protocols for Wireless Sensor Networks
无线传感器网络分簇路由协议

SHEN Bo,ZHANG Shi-Yong,ZHONG Yi-Ping,
沈波
,张世永,钟亦平

软件学报 , 2006,
Abstract: Routing technology at the network layer is pivotal in the architecture of wireless sensor networks. As an active branch of routing technology, cluster-based routing protocols excel in network topology management, energy minimization, data aggregation and so on. In this paper, cluster-based routing mechanisms for wireless sensor networks are analyzed. Cluster head selection, cluster formation and data transmission are three key techniques in cluster-based routing protocols. As viewed from the three techniques, recent representative cluster-based routing protocols are presented, and their characteristics and application areas are compared. Finally, the future research issues in this area are pointed out.
Synthesized Cluster Head Selection and Routing for Two Tier Wireless Sensor Network  [PDF]
Keyur Rana,Mukesh Zaveri
Journal of Computer Networks and Communications , 2013, DOI: 10.1155/2013/578241
Abstract: Large scale sensor networks can be efficiently managed by dividing them into several clusters. With the help of cluster heads, each cluster communicates using some routing schedule. It is essential to rotate the role of cluster heads in a cluster to distribute energy consumption if we do not have dedicated high energy cluster heads. Usually routing and cluster head selection for such networks have been separately solved. If cluster heads are selected with the consideration of routing and routing schedule is prepared with the consideration of selected cluster heads, it can help each other. We have proposed an integrated approach of cluster head selection and routing in two tier wireless sensor network (WSN) using Genetic Algorithm based cluster head selection with A-Star algorithm based routing method to extend life of WSN. This approach can lead to significant improvements in the network lifetime over other techniques. 1. Introduction Wireless Sensor Networks are composed of a large number of sensor nodes with limited resources in terms of energy, memory, and computation. They are operated by a small battery attached to it. This battery has some initial energy, and in every communication it dissipates a fraction of the energy. Many such communications take place during the network lifetime, and every time sensor node consumes some energy which makes battery exhaust eventually. When nodes are deployed in hostile environment or in a kind of environments where it is hard to reach, in most of the cases there is no way to recharge these batteries. Sensor nodes are used for monitoring physical phenomena like temperature, humidity, acoustic, seismic, video, and so on [1]. For large scale wireless sensor networks, applications exist in a variety of fields, including medical monitoring [2–4], environmental monitoring [5, 6], surveillance, home security, military operations, and industrial machine monitoring [7]. To fulfill the requirements of these applications, sensor network should have a lifetime long enough to cater for several months. How to prolong the network lifetime to such a long time is the vital question to design and manage sensor network systems. Randomly deployed sensor nodes in the field collect required data and send towards the base station after processing them. If the optimal path (in terms of energy consumption or quality of service) is chosen for each round of communications, nodes of that particular path may get drained of energy, and network can get partitioned soon. We consider the end of network life as soon as the network gets
Page 1 /100
Display every page Item


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