Search results for: M.T. Honary
chapter
VTC Spring 2008 - IEEE Vehicular Technology Conference > 2844 - 2848
A crucial issue of civilian applications of ad-hoc networks is cooperation of nodes. More precisely, each node has its own authority and may try to maximize the benefits it gets from the network without participating to its services (e.g. without forwarding packets of other nodes). To conquer with this problem, a virtual currency, namely nuglet (Buttyan and Hubaux, 2003), is used to provide an incentive...
chapter
In this paper, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability. In the competition phase in contrast to EECS using a fixed...
chapter
This article introduces an event driven data reporting and routing algorithm for wireless sensor networks that offers a local timing based data reporting scheme in a clustered network. When an event occurs, the nodes that has discovered the event, are supposed to report it to their respective cluster heads. All of these nodes would wait for a specific time (based on its residual energy) to send the...
chapter
Clustering the nodes and controlling the number of cluster heads and members provides an effective way of energy efficiency. In this paper, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer...
chapter
Hierarchical clustering algorithms are very important in increasing the networkpsilas life time. In this paper, we developed the previous proposed algorithm EELTC (An Energy-Efficient Level-based and Time-based Clustering algorithm for Wireless Sensor Networks) that is called EELTC-M (modified EELTC). It is a new hierarchical clustering algorithm and has the ability of creating unequal clusters with...
chapter
Energy efficiency is a critical parameter in wireless sensor networks. Clustering the nodes and controlling the number of cluster heads and members provides an effective way of energy efficiency. In this paper, we develop a clustering protocol for single hop wireless sensor networks. We utilize a competition algorithm for cluster selection phase that the competition's range is a function of distance...
chapter
In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network's life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms...
