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
Clustering algorithm of nodes scheduling for wireless sensor networks
无线传感器网络节点调度优化分簇算法研究*

YI Xiao,DENG Lu,LIU Yu,
衣晓
,邓露,刘瑜

计算机应用研究 , 2011,
Abstract: Due to the limitation of energy in wireless sensor networks, reducing energy usage as much as possible is one main aim of researchers. Based on nodes deployment characteristics in the network, a clustering algorithm of nodes scheduling for wireless sensor networks (CANS) is presented, in which network service quality is not knock-down, and under the situation of redundant nodes through scheduling method of clumps can effectively reduce the number of work-node in the network and save per round of network energy. The simulation result show that compared with other clustering algorithm without considering optimal scheduling of redundant nodes, the algorithm effectively improved the energy utilization of the network and prolonged the network lifetime.
Sensor Scheduling Algorithm Target Tracking-Oriented  [PDF]
Dongmei Yan, Jinkuan Wang
Wireless Sensor Network (WSN) , 2011, DOI: 10.4236/wsn.2011.38030
Abstract: Target tracking is a challenging problem for wireless sensor networks because sensor nodes carry limited power recourses. Thus, scheduling of sensor nodes must focus on power conservation. It is possible to extend the lifetime of a network by dynamic clustering and duty cycling. Sensor Scheduling Algorithm Target Tracking-oriented is proposed in this paper. When the target occurs in the sensing filed, cluster and duty cycling algorithm is executed to scheduling sensor node to perform taking task. With the target moving, only one cluster is active, the other is in sleep state, which is efficient for conserving sensor nodes’ limited power. Using dynamic cluster and duty cycling technology can allocate efficiently sensor nodes’ limited energy and perform tasks coordinately.
A Method for Clustering and Cooperation in Wireless Multimedia Sensor Networks  [PDF]
Mohammad Alaei,Jose M. Barcelo-Ordinas
Sensors , 2010, DOI: 10.3390/s100403145
Abstract: Wireless multimedia sensor nodes sense areas that are uncorrelated to the areas covered by radio neighbouring sensors. Thus, node clustering for coordinating multimedia sensing and processing cannot be based on classical sensor clustering algorithms. This paper presents a clustering mechanism for Wireless Multimedia Sensor Networks (WMSNs) based on overlapped Field of View (FoV) areas. Overlapping FoVs in dense networks cause the wasting of power due to redundant area sensing. The main aim of the proposed clustering method is energy conservation and network lifetime prolongation. This objective is achieved through coordination of nodes belonging to the same cluster to perform assigned tasks in a cooperative manner avoiding redundant sensing or processing. A paradigm in this concept, a cooperative scheduling scheme for object detection, is presented based on the proposed clustering method.
Energy Efficient Multi-Level Clustering To Prolong The Lifetime of Wireless Sensor Networks  [PDF]
Surender Soni,Narottam Chand
Computer Science , 2010,
Abstract: Clustering in wireless sensor networks (WSNs) is an important technique to ease topology management and routing. Clustering provides an effective method for prolonging lifetime of a WSN. This paper proposes energy efficient multi-level clustering schemes for wireless sensor networks. Wireless sensor nodes are extremely energy constrained with a limited transmission range. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compare their performance with existing protocol EEMC. Simulation results demonstrate that our proposed protocols are effective in prolonging the network lifetime.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Networks  [PDF]
Deepali Virmani,Satbir Jain
Computer Science , 2013,
Abstract: Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption, minimizing the distance traversed and minimizing the cost in terms of energy consumption. In CLMAT the node having maximum available energy is used as parent node/ aggregator node. We concluded with the best possible aggregation tree minimizing energy utilization, minimizing cost and hence maximizing network lifetime.
Hard network lifetime wireless sensor networks with high energy first clustering  [PDF]
G.JAYASEELAN,S.K.RAJALAKSHMI
International Journal of Engineering Science and Technology , 2013,
Abstract: Wireless sensor network (WSN) requires robust and energy efficient communication protocols to minimize the energy consumption as much as possible. However, the lifetime of sensor network reduces due tothe adverse impacts caused by radio irregularity and fading in multi-hop WSN. A cluster-based scheme is proposed as a solution for this problem. The proposed scheme extends High Energy First (HEF) clustering algorithm and enables multi-hop transmissions among the clusters by incorporating the selection of cooperative sending and receiving nodes. The performance of the proposed system is evaluated in terms of energy efficiency and reliability. Simulation results show that tremendous energy savings can be achieved by adopting hardnetwork lifetime scheme among the clusters. The proposed cooperative MIMO scheme prolongs the network lifetime with 75% of nodes remaining alive when compared to LEACH protocol. HEF algorithm proved that thenetwork lifetime can be efficiently prolonged by using fuzzy variables (concentration, energy and density). Providing a trustworthy system behavior with a guaranteed hard network lifetime is a challenging task to safetycritical and highly-reliable WSN applications.
Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks
Deepali Virmani,Satbir Jain
International Journal of Computer Science Issues , 2011,
Abstract: A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.
Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks  [PDF]
Deepali Virmani,Satbir Jain
Computer Science , 2012,
Abstract: A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nodes under the control of a sub-sink which further communicate and transfer data to the sink node.
Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithm  [PDF]
T. V. PADMAVATHY, M. CHITRA
Int'l J. of Communications, Network and System Sciences (IJCNS) , 2010, DOI: 10.4236/ijcns.2010.31015
Abstract: Wireless sensor networks (WSNs) are mostly deployed in a remote working environment, since sensor nodes are small in size, cost-efficient, low-power devices, and have limited battery power supply. Because of limited power source, energy consumption has been considered as the most critical factor when designing sensor network protocols. The network lifetime mainly depends on the battery lifetime of the node. The main concern is to increase the lifetime with respect to energy constraints. One way of doing this is by turning off redun-dant nodes to sleep mode to conserve energy while active nodes can provide essential k-coverage, which improves fault-tolerance. Hence, we use scheduling algorithms that turn off redundant nodes after providing the required coverage level k. The scheduling algorithms can be implemented in centralized or localized schemes, which have their own advantages and disadvantages. To exploit the advantages of both schemes, we employ both schemes on the network according to a threshold value. This threshold value is estimated on the performance of WSN based on network lifetime comparison using centralized and localized algorithms. To extend the network lifetime and to extract the useful energy from the network further, we go for compromise in the area covered by nodes.
Mobile Base Station and Clustering to Maximize Network Lifetime in Wireless Sensor Networks  [PDF]
Oday Jerew,Kim Blackmore,Weifa Liang
Journal of Electrical and Computer Engineering , 2012, DOI: 10.1155/2012/902862
Abstract: Using a mobile base station (BS) in a wireless sensor network can alleviate nonuniform energy consumption among sensor nodes and accommodate partitioned networks. In the work of Jerew and Liang (2009) we have proposed a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes a nontrivial tradeoff between the traffic load among sensor nodes and the tour time constraint of the mobile BS. In this paper, we first show how to choose the number of clusters to ensure there is no packet loss as the BS moves between clusters. We then provide an analytical solution to the problem in terms of the speed of the mobile BS. We also provide analytical estimates of the unavoidable packet loss as the network size increases. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm. The results show that the use of clustering in conjunction with a mobile BS for data gathering can significantly prolong network lifetime and balance energy consumption of sensor nodes.
Page 1 /100
Display every page Item


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