No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
COME: Cost Optimization with Multi-chaining for Energy efficient communication in Wireless Sensor Networks
Abstract
In this paper, we present two new chain formation techniques, namely, multi-chain energy-efficient routing (ME) and cost optimisation with multi-chaining for energy efficient communication (COME) for wireless sensor networks supported by linear programming based mathematical models. ME protocol divides network area into subareas of equal size, which contain equal number of randomly deployed nodes. Furthermore, minimum distance based next hop for data transmission is used and the sojourn locations are adjusted in a way that, at a time when data reaches to the last node of the chain (terminator node), BS moves to the possible nearest location of that node (sojourn location). ME uses shorter routes for communication. COME protocol closely inspects the energy costs and selects route with minimum energy cost. Simulations show improved results for our proposed protocols as compared to PEGASIS in terms of the stability period, network lifetime, dropped packets and throughput.
... In [28], selects the sojourn locations in such a way that, when a data packet reaches the terminator node in the chain, the base station moves to the possible nearest location of that node. It allows the base station to collect the data from the nodes directly in an energy-efficient manner at sojourn locations. ...
In wireless sensor networks (WSNs), the clustering architecture balances the energy consumption of the sensor nodes as compared with the flat network architecture. The cluster heads which are nearer to the sink node spend more energy than other cluster heads since it relays the packets in addition to its essential functions. The mobile sinks avoid such an energy hole scenario in sensor networks. Several schemes address the mobility of sink to balance the energy consumption of sensor nodes in the last few years. Those schemes give their attention to either sink path determination or sojourn location determination calculations. Therefore an Energy Efficient Optimal Sojourn Location of Mobile Sink (E2OSLMS) scheme is proposed in this paper to determine the optimal sojourn location of the mobile sink in an energy-efficient manner. In this proposed scheme, the mobile sink moves on a spiral path among clusters and stays in each cluster for a limited time. The sojourn locations are optimized using a fuzzy rule base in each cluster upon the arrival of the mobile sink. The simulation results outperform the proposed scheme as compared with the other two related schemes in terms of energy consumption of nodes and lifetime of the network.
... In [19], the sojourn locations of MS is optimized in such a way that, when the data packet reaches to the last node of the shortest path to the BS, MS starts to move to the possible nearest position of that node. Such scheme aims to reduce the energy consumption of nodes and enhance the network performance. ...
with the fast development of wireless communication and semiconductor devices, home networking has gained considerable attention in the past few years. In Wireless Sensor Networks (WSNs), Sensing coverage is known as one of the most important standards in evaluating the performance of WSNs. The sensor nodes may have failures due to energy depletion during their service life which leads to incomplete coverage of the sensing area and coverage holes in the network which results in reducing the network performance. Therefore, designing an energy-efficient solution to prevent the coverage holes is vital. Employing Mobile Sink (MS) is a popular technique to enhance the energy efficiency of the network. Furthermore, sojourn location optimization is one of the main design issues of mobility based schemes. However, to the best of our knowledge, most of existing sojourn location optimization-based schemes are specially designed for homogeneous networks and much less attention has been devoted to optimizing this parameter in heterogeneous networks. Therefore, the aim behind this paper is to optimize the sojourn location of MS in a heterogeneous home network, which results in improving the coverage time and the performance of the network. Based on the experimental results, the scheme proposed in this paper remarkably improves the balanced energy consumption, which leads to enhanced network lifetime and performance.
... The drawbacks of LCM include; the non-optimal number of CHs and size of the clusters is non-uniform resulting in unbalanced workload on CHs. Ahmad et al. (2015) presented two new chain formation techniques, namely, multi-chain energy-efficient routing (ME) and cost optimisation with multi-chaining for energy efficient communication (COME) for WSNs supported by linear programming based mathematical models. ME protocol divides network area into sections of equal size, which contain the equal number of randomly deployed nodes. ...
Wireless sensors networks (WSNs) are realised as one of the most promising networking types that bridge the gap between the cyber and the things. Designing of routing protocols for WSNs is a challenging issue since sensors are mostly limited in energy and data processing. In this paper, we present a new routing technique for hierarchical routing protocols to enhance energy efficiency in WSNs, namely Routing-Gi. This technique divides network area into the inner grid and clustered grids. In an inner grid, the nodes transmit directly data to the base station (BS), whereas, in clustered grid, the nodes are organised into micro-grids and thus each node transmits data to the BS through it respective cluster head. in this case, the micro-grids help to avoid unbalanced energy consumption in WSNs. Thus, the workload is evenly distributed on nodes causing the efficient energy of network to enhance. The simulation results prove the effectiveness of our technique.
... To this end, an integrated high performance, reliable, scalable and robust communication architecture plays a crucial role to collect timely information from different areas of the grid [2][3][4][5][6]. For the last few years a steep growth has been observed in wireless sensor networks (WSNs) for monitoring applications in various scientific and engineering domains [7][8][9][10][11][12][13]. Recently, WSNs have been widely recognized as a promising technology for enhancing various aspects of electric power grid and realizing the vision of next-generation electric power system in a cost-effective and efficient manner. ...
... The drawbacks of LCM include; the non-optimal number of CHs and size of the clusters is non-uniform resulting in unbalanced workload on CHs. Ahmad et al. (2015) presented two new chain formation techniques, namely, multi-chain energy-efficient routing (ME) and cost optimisation with multi-chaining for energy efficient communication (COME) for WSNs supported by linear programming based mathematical models. ME protocol divides network area into sections of equal size, which contain the equal number of randomly deployed nodes. ...
Abstract: Wireless Sensors Networks (WSNs) have been realized as one of the most
promising networking types that bridge the gap between the cyber and the things.
Designing routing protocols for WSNs is a challenging issue since sensors are mostly
limited in their energy level, data processing, and sensing ability. In this paper, we present
the new routing technique for hierarchical routing protocols to enhance network lifetime
and energy e�ciency in WSNs, namely Routing-Gi technique. This technique divides
network area into the inner grid and clustered grids. The nodes in inner grid transmit
directly data to base station (BS), whereas, in clustered grid, the nodes are organised into
micro-grids and thus each node transmits data to the BS through it respective cluster
head (CH). In this case, the workload on CHs is decreased. Thus, CHs consume less
energy causing the residual energy of network to increase. The simulation results show
that this newly proposed protocols are e�cient than other existing protocols.
... NDN has been analyzed for terrestrial wireless as well as wired networks, including Wireless Sensor Networks [8] [9], Internet of Things [10], Vehicular Networks [11,12,13], etc. However, there is not much work on the feasibility of NDN in underwater networks other than the one in [14]. ...
Underwater Sensor Networks (UWSNs) have been realized as a potential solution for offshore monitoring, undersea military applications, smart fishing, and so on. However, the current communication systems for underwater nodes are facing non-trivial challenges due to the constrained networking conditions. For instance, the sink addresses the node(s) by using their ID(s) to pull the sensed information. However, it is not obvious that the addressed nodes in request message actually are able to provide the requested data. Meanwhile, the Named Data Networking (NDN), aka Content-Centric Networking (CCN), is recently emerged as a potential future Internet architecture. NDN uses the Data Names to pull the required information rather than the IP addresses. In this paper, we check the feasibility of applying NDN into UWSN and name it as UNDN. In addition, we propose the very first naming scheme for UNDN and present the preliminary evaluations.
... Routing protocols play an important role in increasing the stability period and lifetime of a network. Two new chain formation techniques are: Multi-chain Energy-efficient routing (ME) and Cost Optimization with Multi-chaining for Energy efficient communication(COME) [19]. ME protocol divides network area into subareas of equal size, which contain equal number of randomly deployed nodes. ...
Regarding energy efciency in Wireless Sensor Networks (WSNs), routing protocols are engaged in a playful manner suggesting a consciousness of high value. In this research work, we present Circular Joint Sink Mobility (CJSM) scheme for WSNs. Our proposed scheme increases the stability period, network lifetime and throughput of the WSN. The beauty of our proposed scheme is that it controls the cluster head (CHs) election and selection in such a way that uniform load on CHs is ensured and it measures the distances through which each packet is sent from CHs to sink or Base Station (BS). Two mobile sinks are move in opposite direction, therefore each node or CHs calculates its distance and send data to the nearest one to preserve its energy. Thus, proposed scheme minimizes the overall energy consumption of the network. We implement CJSM scheme, in homogeneous, heterogeneous, reactive and proactive simulation environments. Results justify its applicability.
In order to improve the effect of agricultural data collection and transmission, based on the technology adopted by the mainstream agricultural environmental information monitoring system on the market, this paper uses game theory to innovatively improve the algorithm mechanism of wireless sensor nodes, optimise the clustering structure and routing method of wireless sensor networks, design a remote monitoring platform for field farm information and finally build a complete agricultural information monitoring system. Moreover, taking the temperature and humidity sensor as an example, this paper improves the parameters on the basis of testing the various performance of the sensor, and develops the software of the main chip on the basis of the improved node, and completes the driver design of the sensor. In addition, this paper constructs a wireless sensor network data transmission model based on game theory, and combines simulation experiments to conduct experimental research on the system model constructed in this paper. From the test results, it can be seen that the model constructed in this paper has a better effect.
Broadcast is an essential network operation. Designing an energy efficient broadcast becomes an important issue in a wireless sensor network (WSN) because sensor nodes are batterypowered. In a low-duty-cycled WSN with unreliable links, the broadcast problem is challenging because 1) nodes may not be active simultaneously and 2) a transmission may fail to reach all the active nodes. In this paper, we define the least energy consumption broadcast problem, prove it to be NP-hard, and propose a Least-Wake-up-First broadcast scheme (LWF). By reducing the number of forwarders and the number of transmissions, LWF greatly reduces energy consumption while achieving broadcasting. Simulation results verify that LWFimproves energy efficiency in duty-cycled WSNs.
Wireless sensor network (WSN) is an emerging technology
for monitoring physical world.
WSNs consist of large numbers of sensor nodes operated by
battery mostly in harsh environment. Thus energy
conservation is a primary issue for organization of these
sensor nodes. Another crucial issue is the data delivery time
by sensor nodes to the sink node, especially in Military,
medical fields, and security monitoring systems where
minimum delay is desirable.
Number of protocols has been proposed in the literature for
routing. One of such protocols is the cluster based routing
protocol LEACH (low energy adaptive clustering hierarchy).
LEACH protocol organizes WSN into a set of clusters and a
periodic voting for cluster head is performed in order to be
evenly distributed among all the sensors of the WSN. This
periodical cluster head voting in LEACH, however,
consumes an amount of non-negligible energy and other
resources. For energy conservation, PEGASIS (power
efficient gathering in sensor information systems) a near
optimal chain-based protocol has been proposed, however, it
is faced with the challenge of long delay for the transmitted
data. Another routing protocol called CCM (Chain-Cluster
based Mixed routing), which is mainly a hybrid of LEACH
and PEGASIS is proposed, the consumed energy increases as
network size increases.
In this paper, we propose an efficient routing protocol called
CCBRP (Chain-Chain based routing protocol), it achieves
both minimum energy consumption and minimum delay. The
CCBRP protocol mainly divides a WSN into a number of
chains (Greedy algorithm is used to form each chain as in
PEGSIS protocol) and runs in two phases. In the first phase,
sensor nodes in each chain transmit data to their chain leader
nodes in parallel. In the second phase, all chain leader nodes
form a chain (also, using Greedy algorithm) and choose
randomly a leader node then all chain leader nodes send their
data to this chosen leader node. This chosen leader node
fuses the data and forwards it to the Base Station, BS.
Experimental results demonstrate that the proposed CCBRP
outperforms LEACH, PEGASIS and CCM with respect to
the product of the energy consumed and the experienced
delay.
WBSNs (wireless body sensor network) like any other sensor networks suffers limited energy and are the highly distributed network, in which its nodes are the organizer itself and each of them has the flexibility of collecting and transmitting patient biomedical information to a sink. When knowledge sent to sink from a path that doesn't have a definite basis, the routing is a crucial challenge in Wireless Body Area Sensor Networks, additionally reliability and routing delay are the considerable factors in these type of networks. Most of the attention should be given to the energy routing where energy awareness is an essential consideration in WBSNs and the frequent topology change increases the dynamics of network topology, and complicates the process of relay selection in cooperative communications. In this paper, we propose a Min-Max multi-commodity flow model for WBSNs which allows to prevent sensor node saturation and take best action against reliability and the path loss, by imposing an equilibrium use of sensors during the routing process. Simulation results show that the algorithm balances the energy consumption of nodes effectively and maximize the network lifetime. It will meet the enhanced WBSNs requirements, including better delivery ratio, less reliable routing overhead.
Energy efficiency is the main concern of research community while designing routing protocols for wireless sensor networks (WSNs). This concern can be addressed by using energy-harvesting scheme in routing protocols. In this paper, we propose a secure routing protocol that is based on cross layer design and energy-harvesting mechanism. It uses a distributed cluster-based security mechanism. In the cross-layer design, parameters are exchanged between different layers to ensure efficient use of energy. Energy-harvesting system is used to extract and store energy, which is used to take decisions for the node state and thus for the routing issues. Simulation results show that our routing protocol can perform better in many scenarios and in hostile attack-prone environment.
In wireless sensor networks, since sensor nodes are distributed in inaccessible regions for data gathering, they need to be operated during an assigned time without battery recharging and relocation. For this reason, there has been abundant research on improving energy efficiency. PEGASIS, one of the well-known chain-based routing protocols for improving energy efficiency, builds a chain based on the greedy algorithm. However, due to long communication distance of some sensor nodes in a chain formed by the greedy algorithm, unbalanced energy consumption of sensor nodes occurs. Eventually, the network lifetime from this cause decreases. We propose energy efficient chain formation (EECF) algorithm to resolve the unbalanced energy consumption problem caused by long-distance data transmission of some nodes in a chain formed by the greedy algorithm. The simulation results are used to verify the energy consumption balance of sensor nodes and the whole network lifetime. In simulation, it is shown that EECF produces better results than the greedy algorithm.
From energy conservation perspective in Wireless Sensor Networks (WSNs), clustering of sensor nodes is a challenging task. Clustering technique in routing protocols play a key role to prolong the stability period and lifetime of the network. In this paper, we propose and evaluate a new routing protocol for WSNs. Our protocol; Divide-and-Rule (DR) is based upon static clustering and dynamic Cluster Head (CH) selection technique. This technique selects fixed number of CHs in each round instead of probabilistic selection of CH. Simulation results show that DR protocol outperform its counterpart routing protocols.
Recently, Wireless Sensor Networks (WSNs) have been deployed into a variety of applications including homeland security, military systems, and health care. Sensor nodes deployed in such networks are subject to several attacks such as sinkhole and select forwarding, wormhole, Hello flood, and replication attacks. Therefore, developing secure and energy-efficient routing protocols to protect WSNs against these attacks while efficiently utilizing the energy of the deployed nodes has become imperative. Several routing protocols have been proposed in the literature for WSNs. Most of these protocols assume static nodes and sinks to collect data from network fields. However, they may be highly movable, and recent advances show that mobile sensors in WSNs have a promising performance. Therefore, this paper surveys the state of the art on routing protocols related to WSNs and presents the security issues or problems associated with the current protocols as well as discusses the future trends and open research issues on secure routing protocols of WSNs.
The recent advancements in electronics and communications technology have enabled the extensive deployment of wireless sensor networks (WSNs) into a variety of areas including homeland security, military systems, industrial, and health care. WSNs are typically deployed in unattended, hostile and harsh environment which makes them subject to several attacks such as sinkhole, spoofing or Sybil, wormhole, and selective forwarding. Therefore, developing secure, load-balanced and scalable routing protocols for WSNs has become imperative. In the recent literature, most of the routing protocols take the routing decision based on information collected from neighboring nodes. However, this allows a malicious sensor node to deceive its neighbors and forward their packets through it. This makes the network's nodes vulnerable to various attacks. Therefore, in this paper we propose a Dual Sink Secure Routing Protocol (DSSRP) for WSNs. The DSSRP is a scalable protocol for secure routing in which, the routing decision of a node is based on its own information. Thus it cannot be deceived by any other sensor node. Extensive simulation results indicate clearly that, the DSSRP protocol achieves very high confidentiality, integrity, authentication, and non-repetition with a very low overhead. In addition, the proposed protocol exhibits a grateful performance under attack-free conditions by evenly distributing the network load among the deployed nodes thus extending the network lifetime.
One of the major challenges in design of wireless sensor networks (WSNs) is to reduce energy consumption of sensor nodes to prolong lifetime of finite capacity batteries. In this paper, we propose energy-efficient adaptive scheme for transmission (EAST) in WSNs. EAST is an IEEE 802.15.4 standard compliant. In this scheme, open-looping feedback process is used for temperature-aware link quality estimation and compensation, wherea closed-loop feedback process helps to divide network into three logical regions to minimize overhead of control packets. Threshold on transmitter power loss () and current number of nodes (()) in each region help to adapt transmit power level () according to link quality changes due to temperature variation. Evaluation of the proposed scheme is done by considering
mobile sensor nodes and reference node both static and mobile. Simulation results show that the proposed scheme effectively adapts transmission to changing link quality with less control packets overhead and energy consumption as compared to classical approach with single region in which maximum transmitter assigned to compensate temperature variation.
The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.
Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless
networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various
routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has
been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed
among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources.
While another chain-based algorithm PEGASIS (power- efficient gathering in sensor information systems) can reduce such energy
consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster
based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides
a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own
chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as
a cluster in a self- organized manner, where they transmit fused data to a voted cluster head using the cluster based routing.
Experimental results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed
energy and delay, weighting the overall performance of both energy consumption and transmission delay.
KeywordsWireless sensor network-Chain based routing-Cluster based routing-Mobile and ubiquitous computing
Research on wireless sensor networks has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Among various issues, energy consumption is one of the most important criteria for routing protocol in wireless sensor networks (WSNs). This paper introduces an energy efficient clustering algorithm for mobile sensor network based on the LEACH protocol. The proposed protocol adds feature to LEACH to support for mobile nodes and also reduces the consumption of the network resource in each round. The proposed protocol is simulated and the results show a significant reduction in network energy consumption compared to LEACH.
The 21st International Teletraffic Congress, held in Paris from September 15-17, 2009, presented several research papers on telecommunication traffic. The paper 'A new statistical approach to estimate global file populations from local observations in the eDonkey P2P file sharing system' proposed a new statistical approach for the estimation of global population statistics from local observations. 'On the interplay of network structure and routing strategies in scale-free networks' considered scale-free networks. 'Towards end-host based identification of competing protocols against TCP in a bottleneck link' investigated identifiable presence of UDP flows that compete against a TCP flow on a bottleneck link. 'Parametric distributions of connection lengths for the efficient analysis of fixed access network' presented a mathematical framework based on stochastic geometry that takes into account the strong dependency between the telecommunications infrastructure and the road systems infrastructure, in particular for access networks.
DOWNLOAD COMPLETE BOOK FROM
http://AMPL.COM/resources/the-ampl-book/chapter-downloads/
Practical large-scale mathematical programming involves more than just the application of an algorithm to minimize or maximize an objective function. Before any optimizing routine can be invoked, considerable effort must be expended to formulate the underlying model and to generate the requisite computational data structures. AMPL is a new language designed to make these steps easier and less error-prone. AMPL closely resembles the symbolic algebraic notation that many modelers use to describe mathematical programs, yet it is regular and formal enough to be processed by a computer system; it is particularly notable for the generality of its syntax and for the variety of its indexing operations. We have implemented an efficient translator that takes as input a linear AMPL model and associated data, and produces output suitable for standard linear programming optimizers. Both the language and the translator admit straightforward extensions to more general mathematical programs that incorporate nonlinear expressions or discrete variables.
The efficiency of sensor networks strongly depends on the routing protocol used. In this paper, we analyze three different types of routing protocols: LEACH, PEGASIS, and VGA. Sensor networks aresimulated using Sensoria simulator. Several simulations are conducted to analyze the performance of these protocols including the power consumption and overall network performance. The simulationresults, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the powerconsumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased
Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.
Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network cannot operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the lifetime of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.
Wireless Local Area Network (WLAN) has progressed quickly and found its wide applications recently because of mobility, flexibility, extensible and low cost. WLAN has become very important part of future communication. Quality of Service is a hot-point of research about wireless network. Two wireless network loss models, namely random uniformed model and Gilbert-Elliott model, are analyzed. The theoretic results were verified by simulation empirical results. The applications of both models are therefore proved.
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
Wireless Sensor Networks (WSNs) monitors changes in the operational environment and collaborate to actuate distributed tasks in dynamic uncertain and hostile environments. The biggest constraint of these networks is short life time. In this context, various schemes have been presented in order to improve the life time of these networks and to overcome the energy constraint. This paper presents a new cluster based routing algorithm to address the traditional problem of load balancing and energy efficiency in the WSNs. The proposed algorithm makes use of the nodes in a sensor network whose area coverage is covered by the neighboring nodes and marks these nodes as temporary cluster heads. These temporary cluster heads are later used for multihop intercluster communication. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing across the network and is more energy efficient compared to standard Leach and the enhanced version of Leach algorithms.
Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintaining $k$-coverage depends on the area of the monitored region, the probability that a node fails or powers off (to save energy), and the deployment strategy. In this paper, we derive the density required to maintain $k$-coverage under three deployment strategies: (i) nodes are deployed as a Poisson point process, (ii) nodes are uniformly randomly distributed, (iii) nodes are deployed on regular grids. Our results show that under most circumstances, grid deployment renders asymptotically lower node density than random deployment. These results override a previous conclusion that grid deployment may render higher node density than random node distributions.
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies.
Prior work in the field of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insufficient to model interference in large dense packet radio networks accurately. In this paper we present a model that more closely approximates communication theory and the underlying physics of radio communication. Using this model we present a decentralized channel access scheme for scalable packet radio networks that is free of packet loss due to collisions and that at each hop requires no per-packet transmissions other than the single transmission used to convey the packet to the next-hop station. We also show that with a modest fraction of the radio spectrum, pessimistic assumptions about propagation resulting in maximum-possible self-interference, and an optimistic view of future signal processing capabilities that a self-organizing packet radio network may scale to millions of stations within a metro area with raw per-station rates...
Resource biased routing (RBR) algorithm for energy optimization in wireless sensor networks
- L Saraswat
- S Kumar
Saraswat, L. and Kumar, S. (2012) 'Resource biased routing
(RBR) algorithm for energy optimization in wireless sensor
networks', International Journal of Engineering and Innovative
Technology, Vol. 2, No. 3, pp.180-184.
Energy efficient double chain clustered communication protocol for WSN
- G L Pahuja
- G Yadav
Pahuja, G.L. and Yadav, G. (2011) 'Energy efficient double chain
clustered communication protocol for WSN', MIT International
Journal of Electrical and Insrumentation Engineering, Vol. 1,
No. 2, p.10.
Comprehensive study of applications of wireless sensor networks
- M Sunita
- J Malik
- S Mor
Sunita, M., Malik, J. and Mor, S. (2012) 'Comprehensive study of
applications of wireless sensor networks', International Journal
of Advanced Research in Computer Science and Software
Engineering, Vol. 2, No. 11, pp.56-60.
Chain-chain based routing protocolA reliable, efficient routing protocol for dynamic topology in Wireless Body Area Networks using min-max multi-commodity flow model
- S Ali
- S Refaay
- H Moungla
- N Touati
- A Mehaoua
S. Ali, and S. Refaay, "Chain-chain based routing
protocol", IJCSI International Journal of Computer
Science, Issues 8.3, pp. 1694-0814, 2011.
[19] H. Moungla, N. Touati, and A. Mehaoua, "A
reliable, efficient routing protocol for dynamic
topology in Wireless Body Area Networks
using min-max multi-commodity flow model",
e-Health Networking, Applications and Services
(Healthcom), 2012 IEEE 14th International
Conference on. IEEE, 2012.
Divide-and-rule scheme for energy efficient routing in wireless sensor networks
- K Latif
- A Ahmad
- N Javaid
- Z A Khan
- N Alrajeh
Latif, K., Ahmad, A., Javaid, N., Khan, Z.A. and Alrajeh, N. (2013)
'Divide-and-rule scheme for energy efficient routing in wireless
sensor networks', The 4th International Conference on Ambient
Systems, Networks and Technologies (ANT 2013), Procedia
Computer Science, Vol. 19, pp.340-347.