No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
On the Data Dissemination in WSNs
Abstract
Data dissemination has been put forward as an important mechanism for WSN. The dissemination schemes allow sink nodes to diffuse information in the network. It is known as an energy-consuming phase. In this paper, we propose to resolve this problem in two steps: firstly using a localized self-organization scheme which generates a non-directed backbone; secondly, sink node sends a request through this backbone to create a directed dissemination structure in the network. Our scheme effectively reduces the data traffic during the dissemination phase and saves energy when compared to other schemes. It is also extended to run properly in multiple sinks and mobile sink scenarios. The results also put forward the benefits of using a self-organization scheme for data dissemination.
... Le protocole BBDD (Backbone Based Data Dissemination) [96] vise à la fois à réduire l'énergie nécessaire pour le trafic P2MP (diffusion de l'information du noeud puits ou actionneur à tous les noeuds du réseau) et à faciliter le trafic MP2P (la collecte de données provenant de capteurs vers le puits ou l'actionneur). BBDD utilise une approche en deux étapes : Une première étape de construction de topologie logique ; Une deuxième étape, permettant d'orienter la topologie pour faciliter le trafic de collecte de données. ...
... Dans cette section, nous commençons par faire une étude de complexité de notre proposition et la comparer avec le protocole BBDD [96]. Nous avons choisi de comparer notre proposition Far-Legos avec le protocole BBDD parce qu'ils se basent tous les deux sur le même protocole d'autoorganisation Legos [97]. ...
... Nous faisons varier la taille de la zone non-couverte dans le réseau en faisant varier la portée de(s) noeud(s) actionneur(s). Nous comparons les performances de notre proposition Far-Legos avec les performances obtenues avec le protocole BBDD [96]. Tout d'abord, pour une petite zone non-couverte, nous notons que Far-Legos offre un meilleur délai de bout-en-bout que BBDD pour les deux types de topologies. ...
In this thesis, we focused on urban wireless networks considered by the ANR project ARESA2. The networks considered by this project are heterogeneous networks. This heterogeneity is caused by the coexistence of sensor nodes with limited resources and actuator nodes with higher resources. Actuators nodes should be used differentially by the network. Hence designed protocols for WSANs should exploit resource-rich devices to reduce the communication burden on low power nodes. It is in this context that this thesis takes place in which we studied self-organizing and routing algorithms based on the heterogeneity. First, we are interested in self-organization protocols in a heterogeneous network. Based on the idea that resource-rich nodes must be exploited to reduce the communication load level on low-power nodes, we proposed self-organizing protocol called Far-Legos. Far-Legos uses the large transmit power of actuators to provide gradient information to sensor nodes. Actuators initiate and construct a logical topology. The nature of this logical topology is different inside and outside the transmission range of these resourceful nodes. This logical topology will be used to facilitate the data collection from sensor to actuator nodes. Second, we investigated the asymmetric links caused by the presence of heterogeneous nodes with different transmission ranges. The apparition of asymmetric links can dramatically decrease the performance of routing protocols that are not designed to support them. To prevent performance degradation of these routing protocols, we introduce a new metric for rank calculation. This metric will be useful to detect and avoid asymmetric links for RPL routing protocol. We also present an adaptation of data collection protocol based on Legos to detect and avoid these asymmetric links. Finally, we are interested in exploiting the asymmetric links present in the network. We proposed a new routing protocol for data collection in heterogeneous networks, called AsymRP. AsymRP, a convergecast routing protocol, assumes 2-hop neighborhood knowledge and uses implicit and explicit acknowledgment. It takes advantage of asymmetric links to ensure reliable data collection.
... mobile sinks. This strategy is implemented in protocols like TTDD [1], GHT [2], LBDD [3], DDB [4], etc. They all use the concept of virtual infrastructure which acts as a rendez-vous area for storing and retrieving the collected measurements. ...
... If the distance between the sink and its sink manager exceeds a given value, a new sink manager is chosen and a logical link towards the old sink manager is established. This approach is used by RailRoad [8], LBDD [3], DDB [4], etc. ...
... In the rest of this subsection we survey the backbone-based data dissemination protocols. DDB: Dynamic Directed Backbone (DDB) [4] defines a data dissemination protocol on top of a self-organization scheme called LEGOS [4]. LEGOS provides and maintains a distributed and dynamic communication structure, with low message cost, where each sensor node can be either a member, a leader or a gateway, as shown onFigure 3. The leader is in charge of all its member communications, and can be linked to another leader using a gateway node, thus forming a dynamic backbone. ...
A wireless sensor network is a multihop wireless network consisting of spatially distributed autonomous sensors with sensing, computation, and wireless communication capabilities. Generally, each sensor has the task to monitor and measure ambient conditions and disseminate the collected data toward a base station, or sink, for data post-analysis and processing. Many data dissemination protocols have been proposed to allow the dissemination of the collected data toward a static sink. Recently, mobile sinks were shown to be more energy-effective than static ones. In this article, existing data dissemination protocols supporting mobile sinks are summarized. In addition, sink mobility is analyzed, as well as its impact on energy consumption and the network lifetime.
... Recently, many protocols for supporting the mobile users on wireless sensor networks have been proposed [2][3][4][5][6][7][8][9][10][11]. The proposed protocols usually take into account temporary structures to deliver data to mobile users. ...
... In wireless sensor networks, many routing protocols [2][3][4][8][9][10][11] have been proposed to support mobile sinks which move freely within the sensor field. They identify a user with a sink as shown in Fig. 1c. ...
... As virtual infrastructures with position, TTDD [2] exploits a grid structure, SEAD [3] exploits a tree structure, HDDS [4] exploits a hierarchical quads structure, LBDD [8] exploits a line structure, and RailRoad [9] exploits a circle structure. As virtual infrastructure without position, DDB [10] exploits single-level cluster structure and HCDD [11] exploits multiple-level cluster structure. However, if the sensor field cannot have legacy networks, the mobile sink cannot deliver data from the sensor field to remote users. ...
A wireless sensor network typically consists of users, a sink, and a number of sensor nodes. The users may be remotely connected to a wireless sensor network and via legacy networks such as Internet or Satellite the remote users obtain data collected by the sink that is statically located at a border of the wireless sensor network. However, in practical sensor network applications, there might be two types of users: the traditional remote users and mobile users such as firefighters and soldiers. The mobile users may move around sensor fields and they communicate with the static sink only via the wireless sensor networks in order to obtain data like location information of victims in disaster areas. For supporting the mobile users, existing studies consider temporary structures. However, the temporary structures are constructed per each mobile user or each source nodes so that it causes large energy consumption of sensor nodes. Moreover, since some of them establish the source-based structure, sinks in them cannot gather collective information like mean temperature and object detection. In this paper, to effectively support both the remote users and the mobile users, we propose a novel service protocol relying on the typical wireless sensor network. In the protocol, multiple static sinks connect with legacy networks and divide a sensor field into the number of the multiple sinks. Through sharing queries and data via the legacy networks, the multiple static sinks provide high throughput through distributed data gathering and low latency through short-hops data delivery. Multiple static sinks deliver the aggregated data to the remote users via the legacy networks. In case of the mobile users, when a mobile user moves around, it receives the aggregated data from the nearest static sink. Simulation results show that the proposed protocol is more efficient in terms of energy consumption, data delivery ratio, and delay than the existing protocols.
... In order to reduce the error, we repeat the experiment 100 times. Figure 5 shows the placement of relay nodes and their coverage area in CoDA, HCDD [47], and DDB [48], where there are 200 sensor nodes distributed in the field of four square sides with a length of 400 m. When the synchronous data packet transmission is finished, the clock drift can be obtained by the formula: ...
... In order to reduce the error, we repeat the experiment 100 times. Figure 5 shows the placement of relay nodes and their coverage area in CoDA, HCDD [47], and DDB [48], where there are 200 sensor nodes distributed in the field of four square sides with a length of 400 m. By comparison, we can find that the number of relay nodes in CoDA is 14, which is a minimum feasible topology for relay nodes. ...
To implement minimum power consumption of the link, cluster heads adopt the multi-hop manner for inter-cluster communication so as to forward the aggregation data to the relay nodes. This paper proposes a collaborative data aggregation in emerging sensor networks using a bio-level Voronoi diagram, which is an energy-efficient data aggregation protocol that integrates topology control, Multiple Access Control (MAC) and routing. The sensor nodes situated in the lower level of the diagram are responsible for listening and gathering data, and should be organized by optimal clustering node. In the inter-cluster communication stage, a particle swarm optimization algorithm is addressed to seek optimal transmission path which could simultaneously achieve the minimization of the maximum next hop distance between two nodes in the routing path and the minimization of the maximum hop count, so the minimization of whole network energy consumption is realized. The results of theoretical analysis and simulation results show that energy efficiency and synchronization accuracy of the proposed algorithm can be much better than with traditional routing protocols, and the energy consumption of nodes in the whole network can be more balanced.
... QDD (Mir and Ko, 2006), Locators (Shim and Park, 2006 ), LBDD (Hamida and Chelius, 2008), DDB (Lu and Valois, 2007), QAR (Rumin et al., 2010), ToW (Joung and Huang, 2008)… DEEP (Vecchio et al., 2010), RaWMS (BarYossef et al., 2008), MDRW (Viana et al., 2009), RAPID (Drabkin et al., 2007), MOAP (Mukhtar et al., 2009 ), McTorrent (Huang et al., 2010), SSA (Chung et al., 2011), SDS (Shen et al., 2011)… ...
... In simple flooding, the more duplicate broadcasted packets a node receives, the less effective its rebroadcasting becomes (Lu and Valois, 2007). This is because the duplicate messages are likely to have been received by its neighboring nodes. ...
Wireless sensor networks (WSN) have recently gained a great deal of attention
as a topic of research, with a wide range of applications being explored such
as communicating materials. Data dissemination and storage are very important
issues for sensor networks. The problem of designing data dissemination
protocols for communicating material needs different analyses related to
storage density and uniformity which has not been addressed sufficiently in the
literature. This paper details storage protocol on the material by systematic
dissemination through integrated wireless micro-sensors nodes. The performances
of our solutions are evaluated through simulation using Castalia/OMNeT++. The
results show that our algorithm provides uniform data storage in communicating
material for different density level.
... The backbone-based approaches use self-organization schemes to build a virtual structure [4] (such as a cluster, backbone, dominating set) over the physical network to assist the process of data posting. The DDB self-organization approach [6] maintains a dynamic and distributed communication architecture. In this scheme, each source node can be a leader, member, or gateway. ...
... However, these dissemination schemes cannot be directly applied due to the ever-shifting nature of VANETs. Researchers have proposed various data dissemination protocols for VANET environments [4,9,7,6,10,11,12]. Some protocols avoid broadcast packets for each node, and may cause broadcast storm problems that decrease network performance. ...
Due to recent developments in wireless communication networks, Vehicular Ad-hoc Networks (VANETs) technologies have received a lot of attention in the fields of information sharing and service discov-ery. However, due to the ever-shifting mobility of vehicle topology, vehicles moving along non-fixed routes may not find suitable next-hop vehicles. This paper proposes schemes to effectively circulate and discover service information with the aid of public transportation systems. Bus routes can be used to create a backbone structure on which data can be posted and circulated to avoid the broad-cast storm problem. The proposed architecture can effectively disseminate and discover the required data through the traffic infrastructure and mobile vehicles. Experimental results demonstrate that the proposed scheme outperforms other schemes in terms of packet delivery ratio and end-to-end delay. Moreover, the overhead of this scheme is less than other schemes with an increasing of number of service requests.
... DDB [10] organizes sensor nodes into one-hop clusters. A sensor node in each cluster is selected as a Leader (namely, CH) and the other sensor nodes in each cluster become Members. ...
... In this section, we evaluate the performance of the proposed protocol with that of HCDD [9] and DDB [10] for supporting sink mobility by a BVI without global location information via the GPS or the localization techniques through simulation results. ...
In wireless sensor networks, the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) to avoid the routing structure construction per each mobile sink by full network flooding. The BVI approach typically considers one-hop clusters and a backbone structure-based tree configured by the cluster heads (CHs). For data dissemination to a mobile sink, the head of the cluster where the mobile sink exists registers the backbone structure on behalf of the sink, and then source nodes generate the data to their CHs via the tree. Finally, the CHs deliver the data to the mobile sink. However, the one-hop cluster makes the tree organized by too many CHs so that it causes large location registration overhead according to movement of the sink. Moreover, the data delivery via the tree with a large number of CHs might lead to data delivery from source nodes to the sink though detour paths due to always delivering data via the tree. Namely, although the source nodes exist at nearest clusters from the cluster attached by the sink, if they are located in different branch of the tree, the data should be delivered via detour paths on the tree. Therefore, we propose a novel BVI-based communication protocol to support sink mobility without global position information. To reduce the number of CHs, we consider multi-hop clusters. Also, to avoid the location registration of a mobile sink to the whole CHs, we uses a rendezvous CH on which queries of the mobile sink and reporting data of a source node meet. However, such a manner also has data detour problem that the source node sends data packets to the mobile sink via the rendezvous CH. Thus, we present a scheme to find a path with fewer hop-counts between CHs where the source node and the mobile sink are located in. Simulation results show that the proposed protocol is superior to the existing protocols in terms of the control overhead and the data delivery hop counts.
... Sev- INRIA eral protocols have been proposed for this type of traffic. We find the BBDD (Backbone Based Data Dissemination) protocol [10] that aims both at reducing the energy required to disseminate information from the sink to all nodes in the network and at facilitating the data collection from sensors to sink node. BBDD uses a two step approach. ...
... We are interested in the end-to-end delay and the delivery ratio when we increase the number of events detected by sensor nodes in the network. We compare the performance of our FAR-Legos proposal with the performance obtained when using BBDD protocol [10]. We define the end-to-end delay as the average time required by a message originating at a sensor node to reach the final destination (the actuator node).Figure 5(a) andFigure 5 (b) represent the topologies obtained with our FAR- Legos proposal for a small non-covered area and a large non-covered area, re- spectively. ...
In Wireless Sensors and Actuators Networks (WSANs), actuator nodes are nodes richer in resources (processing capacity, power transmission and energy storage) and better suited than sensor nodes to process the data, make decisions based on sensed values and perform appropriate actions. In addition, in order to provide timely action, coordination between sensors and actuators is necessary. Thus, in addition to the classical energy constraints of Wireless Sensor Networks (WSNs), WSANs also impose new challenges such as how to support and benefit from the nodes heterogeneity while preserving energy in the self-powered sensor nodes. New communication protocols, specific to WSANs, are needed. In this report, we propose a hybrid self-organizing data-collection protocol in order to provide energy efficiency, low end-to-end delay and high delivery ratio while taking advantage of the resource available on the actuators nodes in the network. This new self-organization protocol constructs its structure from the actuators and other resource-plentiful nodes. The nature of the structure is different inside and outside of transmission range of these resourceful nodes. Two variant of our proposal are detailed also in this report.
... To offer data dissemination with low energy consumption, dynamic directed backbone (DDB) protocol [7] is built on top of the low energy self-organization scheme. A nondirected backbone is built by localized selforganization scheme. ...
Mobile sink node properly used in routing protocols can improve network performance. Thus we investigate location-based routing protocols. The latter strategy can be further classified into backbone-based and rendezvous-based routing protocols. We first describe the main principles of the two location-based routing protocols with sink mobility support respectively. Then we analyze their advantages and disadvantages.
... Lu and Valois [32] proposed DDP, which indicates that data dissemination is designed on top of the low-energy self-organization scheme with low energy usage, dynamic guided backbone protocol. This would minimize data traffic and be applied to the scenario of mobile sinks and multi-sinks. ...
Wireless Sensor Networks (WSNs) consist of small, irreplaceable batteries that are able to detect, collect and transmit data. Sink node mobility is an efficient approach to improving the lifetime of the network to reduce overhead signaling and achieve a high packet delivery ratio. The use of energy is the large number of WSNs, there are so many routing algorithms and for the energy consuming problem, routing protocols are developed. It focuses on sink mobility and routing protocols, which may differ depending on the architecture of the application and network. The state of the art of sink mobility in WSNs is presented as a survey with routing protocols. The challenges in the design of the protocols are presented and the comparison of the latest routing protocols supported by mobile sinks is also described and the other issues also listed in WSNs are discussed, followed by the conclusion.
... The higher-level structure is formed by the cluster heads (CHs) that are responsible for accumulation of the global information. Valois et al. [31] proposed a Dynamic Directed Backbone (DDB) that consists of hightier structured backbone. It comprises of two types of nodes, namely the gateway and the leader nodes. ...
The advances in hardware manufacturing technologies and wireless communications enabled the evolution of tiny, multi-functional, low-power and resource constrained sensor nodes (SNs) for wireless sensor networks (WSNs). SNs located in sinks vicinity, deplete their batteries quickly because of concentrated data traffic near the sink, leaving the data reporting wrecked and disrupted. In order to mitigate this problem, mobile sinks are introduced that provide uniform energy consumption and load balanced data delivery through the sensor network. However, advertising the mobile sinks position information brings forth additional overhead in terms of energy wastage. Recently, an energy-efficient distributed mobile sink routing protocol named ring routing has been proposed aiming to mitigate the introduced overhead. In this present work, we propose an Energy Efficient Secured Ring Routing () protocol which is an enhancement of existing ring routing protocol [62] that considers rechargeable sensors to be deployed in the sensing region and employs Maximum Capacity Path (MCP), a dynamic load balanced routing scheme for load balancing and prolonging the networks lifetime. Furthermore, we use 2ACK scheme that serves as an efficient mechanism for detecting the routing misbehaviour and simultaneously enhance the security. Finally, the proposed protocol was simulated by varying the sink speed for similar node deployments and the results obtained confirm that the proposed achieves improved performance than the existing protocols such as LBDD (Line Based Data Dissemination), rail road and ring routing.
... This algorithm is very effective for choosing high-tier nodes, but high-tier nodes suffer from hot spot problem and affect the network performance. Dynamic Directed Backbone (DDB) protocol (Lu and Valois 2007) forms a backbone for high-tier nodes and minimizes the spot near to higher nodes. ...
Wireless sensor networks (WSNs) are characterized by many to one traffic pattern, where a large number of nodes communicate their sensed data to the sink node. Due to heavy data traffic near the sink node, the nodes closer to sink node tends to exhaust their energy faster compared to those nodes which are situated away from the sink. This may lead to the fragment of a network due to the early demise of sensor nodes situated closer to the sink. To pacify this problem, mobile sinks are proposed for WSNs. Mobile sinks are capable to provide uniform energy consumption, load distribution, low reporting delay and quick data delivery paths. However, the position of the mobile sink needs to be updated regularly as such position update messages may reduce the network lifetime. In this paper, we propose a novel Location Aware Routing for Controlled Mobile Sinks (LARCMS), which will help in minimizing reporting delay, enhancing network lifetime, handling sink position updates and providing uniform energy consumption. The proposed technique uses two mobile sinks in predefined trajectory for data collection and provides better results compared to existing techniques. The performance of LARCMS is evaluated by comparing with similar mobile sink routing protocols through extensive simulations in MATLAB.
... Lu and Valois [9] designed a Dynamic Directed Backbone (DDB) to constructs a backbone in WSN. The sensor nodes are initialized in the network. ...
... But an adversary can change the data that is being disseminated or forge a data item. Hence various security mechanisms need to be implemented to protect the data from attacker [3], [4]. Security of a system addresses three major concerns i.e. data authenticity, data integrity and data confidentiality. ...
Security and confidentiality of data is very much essential while deploying a wireless sensor network. Depending on the environment in which network is deployed; configuration parameters of network nodes need to be updated time to time. This can be achieved using data discovery and dissemination protocols. DiDrip is the first data discovery and dissemination protocol that has been designed by taking different security vulnerabilities in mind. The protocol expedites network owner to authorize multiple network users having different privileges for simultaneous and direct dissemination of data into the network nodes. This paper proposes a new technique to minimize packet loss during data dissemination using DiDrip protocol and provide high security to wireless sensor network. RSA and Diffie Hellman key exchange algorithm are used as methods of encryption.
... To offer data dissemination with low energy consumption, dynamic directed backbone (DDB) protocol [7] is built on top of the low energy self-organization scheme. A non-directed backbone is built by localized self-organization scheme. ...
... The purpose of the data dissemination is to send any type of information (data or request) to all nodes affected by this information, while minimizing the number of transmission nodes and the cost of energy [1]. Data dissemination is considered as a main phase of energy consumption in the communication of WSNs [2]. ...
The purpose of the data dissemination in wireless sensor networks is to send any type of information (data or query) to all nodes concerned by this information, while minimizing the number of transmission nodes and the cost of energy. Data dissemination is considered as a main phase of energy consumption in the communication of Wireless Sensor Networks. Hence the way to eliminate redundant data traffic and reduce communication cost are the main challenges of the data dissemination. Depending on how to collect data and process them, we can distinguish in this article the Client/Server based data dissemination protocols, and the Mobile Agents protocols.
... Many of data dissemination and routing protocols are proposed to solve network's overhead problem and to minimize the communication cost that caused by sink's mobility. Most of these approaches are hierarchal based and can be classified into grid based [3][4][5]16], tree based [6,17], cluster based [7][8][9] and backbone based [18,19]. ...
Abstract—Data dissemination toward static sinks causes the nearby nodes to deplete their energy quicker than the other nodes in the field (i.e., this is referred to as the hotspot problem). Accordingly, topology disruptions will occur and no data will be delivered to the sink. Mobile sinks are proposed to solve the hotspot problem in wireless sensor networks; they provide a load balancing and an energy consumption balancing for the whole network. However, sink mobility introduces new challenges (e.g., frequent location updates and packets delay). In this paper, we proposed a distributed sink-oriented dissemination protocol called Sink-oriented Tree based Data Dissemination (STDD). STDD constructs just one main dissemination tree for each mobile sink. When the access node is changed, the main tree will be updated and maintained to guarantee the shortest path to the mobile sinks. The updated and maintained tree is not a new tree; however, it is just a new version with only a few changes in a few levels of the main tree itself. Simulations show that STDD achieves a significant performance in terms of latency, network lifetime, delivery rate, and energy consumption compared with the state-of-the-art approaches.
https://www.youtube.com/watch?v=6hzxbq7TZ0o
... The purpose of the data collection is to send any type of information (data or request) to all nodes affected by this information, while minimizing the number of transmission nodes and the cost of energy [1]. Data collection is considered as a main phase of energy consumption in the communication of WSNs [2]. Hence the way to eliminate redundant data traffic and reduce communication costs are the main challenges of the data collection. ...
Mobile Agents (MAs) are referred to as autonomous application programs with the inherent ability to move between nodes towards a goal completion. In the context of Wireless Sensor Networks (WSNs), MAs may be used in the process of combining data from different sources aiming at maximizing the useful information content. MAs have been initially developed to replace the Client/Server model which exhibits many disadvantages, particularly in WSN environments (e.g. heavy bandwidth usage and high energy consumption). Mobile Agents can be used to significantly reduce the cost of communication, especially through low bandwidth, by moving the processing function to the data rather than bring the data to a central processor. The main objective of this paper is to analyze some Client/Server and Mobile Agent data dissemination protocols in WSN.
... The purpose of the data dissemination is to send any type of information (data or applications) to all nodes affected by this information, while minimizing the number of transmission nodes and the energy cost [1]. Data dissemination is considered as a main phase of energy consumption in the communication of WSNs [2]. Hence the way to eliminate redundant data traffic and reduce communication costs are the main challenges of the data dissemination. ...
Recently, Mobile Agents have been used for efficient data dissemination in wireless sensor networks. In the traditional Client/Server architectures, data sources are transferred to a destination while in Mobile Agents architectures, a specific executable code passes through relevant sources to collect data. Mobile Agents can be used to significantly reduce the cost of communication, especially through low bandwidth, by moving the processing function to the data, rather that bringing the data to a central processor. This work proposes to use a Client/Server approach using Mobile Agents to aggregate data in a planar architecture of wireless sensor network.
... The purpose of the data dissemination is to send any type of information (data or query) to all nodes affected by this information, while minimizing the number of transmission nodes and the energy cost [1]. Data dissemination is considered as a main phase of energy consumption in the communication of WSNs [2]. Hence the way to eliminate redundant data traffic and reduce communication costs are the main challenges of the data dissemination. ...
Depending on how to collect data and process them, we can distinguish the traditional Client/Server based data dissemination protocols, and the Mobile Agents protocols. In the traditional Client/Server architectures, data sources are transferred to a destination to be processed there, while in Mobile Agents architectures, a specific executable code passes through relevant sources to collect and process data. Mobile Agents can be used to significantly reduce the cost of communication, especially through low bandwidth, by moving the processing function to the data, rather that bringing the data to a central processor. This work proposes to use a Client/Server approach using Mobile Agents to aggregate data in a planar architecture of wireless sensor network.
... Dynamic Directed Backbone (DDB) [38] constructs a backbone as the high-tier structure. The backbone is composed of leader and gateway nodes. ...
In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.
... The main purpose of data dissemination is not only to transmit information related to data or query; but also to reduce the overall energy consumption [4,5]. A number of protocols have been proposed to achieve reliable data dissemination in WSNs. ...
In resource constrained wireless sensor networks (WSNs) it is important to utilize energy efficiently. Data dissemination is mainly responsible for the consumption of energy in sensor nodes (SNs). The data dissemination protocols for WSNs should reduce the energy consumption of the SNs. Sink and source mobility is the major challenge for data dissemination protocols. In this paper, a Tier based Energy Efficient protocol (TBEE) providing sink and source mobility in WSNs has been proposed. TBEE protocol has been designed so that fewer SNs located nearer to the dissemination point (DP) respond to the sinks message for grid formation thereby reducing message overheads. TBEE exploits an improved approach of communication amongst the SNs so that the collisions are reduced. TBEE efficiently handles the movement of the sinks and sources in the network and reduces the overheads associated with their mobility. TBEE's performance was evaluated in different conditions and scenarios. Simulation results show substantial improvement by TBEE as compared with the other existing grid based approaches for most of the scenarios.
... The most prominent hierarchical two-tier protocols include Grid-Based Energy-Efficient Routing (GBEER) [4], Hierarchical Cluster-based Data Dissemination (HCDD) [5], Dynamic Directed Backbone (DDB) [6] and Line-Based Data Dissemination (LBDD) [7]. These protocols respectively utilize a rectangular grid, a clustered tree, a backbone, and a line strip as the second-tier structures. ...
Mobile sinks are proposed as a possible solution to the hotspot problem, which leads to the early death of the nodes close to the sink, due to the concentration of data traffic towards the sinks. However, the route updates employed by the source nodes to determine the position of the sinks introduce an overhead in terms of data reporting delays and energy consump-tions. On the other hand, decreased frequency of route updates causes stale sink position information to be utilized for data packets which results in suboptimal data dissemination paths. In this paper, we investigate this inherent trade-off and provide an insight on how to fine tune the route update parameters of a mobile sink routing protocol. For this purpose, we define a system employing a simple routing protocol and determine the optimal operating points from the results obtained via simulations, under varying degrees of route updates and sink mobility.
... 1) DDB: Dynamic Directed Backbone (DDB) [40] constructs a backbone as the second-tier structure. The backbone is composed of leader and gateway nodes. ...
The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
... We have proposed a data dissemination structure, i.e., Backbone Based Data Dissemination (BBDD), which could also work as a data aggregation structure [19]. BBDD is a twolevel structure based on a self-organization process. ...
Wireless sensor networks (WSNs) are data centric networks to which data aggregation is a central mechanism. Nodes in such networks are known to be of low complexity and highly constrained in energy. This requires novel distributed algorithms to data aggregation, where accuracy, complexity and energy need to be optimized in the aggregation of the raw data as well as the communication process of the aggregated data. To this end, we propose in this work a distributed data aggregation scheme based on an adaptive Auto-Regression Moving Average (ARMA) model estimation using a moving window technique and running over suitable communications protocols. In our approach, we balance the complexity of the algorithm and the accuracy of the model so as to facilitate the implementation. Subsequent analysis shows that an aggregation efficiency of up to 60% can be achieved with a very fine accuracy of 0.03 degree. And simulation results confirm that this distributed algorithm provides significant energy savings (over 80%) for mass data collection applications.
The past few years have witness growing interest in the prospect use of wireless sensor
networks (WSNs) in enormous domain of applications and it became an interesting
research area. WSNs are a type of network that consists on number of nodes that connect
with each other without a physical medium. The nodes are tiny size and consist on a small
battery with limited energy and unplugged with power resources. The sensor network
formally contain on two types of nodes: member nodes (MN), which has to detect action
from surrounding area and send the detecting signal to each other until it reach the source
node. As well as, the sink node (S), this has a task of collecting the sensing data from
member nodes. A main problem faces this type of network is that; the nodes which are
close to the sink will deplete their power faster than other nodes because the whole data
throughput path comes throw these nodes. Researcher tries hardly to solve this problem by
suggesting many protocols that help to disband this issue, beside many routing protocols
that been suggested to pass the data throw the network, many other protocols suggest that to divide the sensing area into grids or cells as clusters, each group of nodes connect with each other and send their detective data packet to one of cluster nodes which called cluster-head (CH). CHs task inside the network is to connect with each other in order to receive the data from MNs and send it to S. Many networks developers suggest that the sink has to be routable and moves around the network and collect data from MNs directly. The mobile sink can reduce the energy depletion of the nodes subsequently will enhance the network lifetime. The major issue while utilising this technique is how to detect the sink while moving. In our thesis, we initiate a similar network that been divided into multi-clusters and each cluster contain a cluster-head, and the sink has to be routable in order to ease the data collection process by reducing the number of hops for data packet from source to destination. We suggest a new protocol called Hexagonal Grid based Dynamic routes Adjustment (HGDRA) which divides the network cells into hexagonal cells and used the mobile sink technique inside the network area. Our technique is tries to reconstruct a data packet path that detect the mobile sink with less energy consumption, as well as, less number of hops. We gain a better result in aspects of network reconstruction cost, number of hops, nodes residual energy and network lifetime in general. As well as, we suggest a hybrid version of our first protocol with additional sink route reconstruction mechanism called Hexagonal Grid based Dynamic routes Adjustment with Smart sink (HGDRA-S). The new suggested technique with the smart sink helps to improve the data collection mechanism, furthermore, improved the network lifetime. We demonstrate our result via the same performance evaluation factors that we used in the first protocol. We used Ns2
simulator to demonstrate our result by comparing our suggested protocols with the base work protocol and we gain a significant improvement for both protocols.
This paper is aimed at giving an insight view over the research domains across various levels of Mobile Ad-hoc Networks. A mobile ad-hoc sensor network follows a broader sequence of operational scenarios, unlike typical sensor networks that communicate with the centralized controller. Hence they demand a less complicated setup favorably. Mobile ad-hoc sensors are otherwise known as hybrid ad-hoc networks that consist of some sensors spreads in a geographical area. All individual sensors are capable of mobile communication and have some level of intelligence to process signals and to transmit information. Mobile ad-hoc sensor networks are very constructive in different circumstances. These networks advance the operational efficiency of individual civilian applications. Mobile ad-hoc sensor network becomes highly adaptable so that it can be deployed in almost all environments .The evolution of research in MANET has been started from routing of packets, error free routing, reliable route to stable and secure path of communication in present days. Recent researchers may have much opening in the space of security over the data transmission in the MANET.
Wireless Sensor Networks (WSNs) have been regarded as an emerging and promising field in both academia and industry. Currently, such networks are deployed due to their unique properties, such as self-organization and ease of deployment. However, there are still some technical challenges needed to be addressed, such as energy and network capacity constraints. Data aggregation, as a fundamental solution, processes information at sensor level as a useful digest, and only transmits the digest to the sink. The energy and capacity consumptions are reduced due to less data packets transmission. As a key category of data aggregation, aggregation function, solving how to aggregate information at sensor level, is investigated in this thesis. We make four main contributions: firstly, we propose two new networking-oriented metrics to evaluate the performance of aggregation function: aggregation ratio and packet size coefficient. Aggregation ratio is used to measure the energy saving by data aggregation, and packet size coefficient allows to evaluate the network capacity change due to data aggregation. Using these metrics, we confirm that data aggregation saves energy and capacity whatever the routing or MAC protocol is used. Secondly, to reduce the impact of sensitive raw data, we propose a data-independent aggregation method which benefits from similar data evolution and achieves better recovered fidelity. Thirdly, a property-independent aggregation function is proposed to adapt the dynamic data variations. Comparing to other functions, our proposal can fit the latest raw data better and achieve real adaptability without assumption about the application and the network topology. Finally, considering a given application, a target accuracy, we classify the forecasting aggregation functions by their performances. The networking-oriented metrics are used to measure the function performance, and a Markov Decision Process is used to compute them. Dataset characterization and classification framework are also presented to guide researcher and engineer to select an appropriate functions under specific requirements.
L'auto-organisation de réseaux radio multi-sauts a pour objectif de structurer/organiser un réseau à l'aide d'une structure logique. Pourquoi le structurer ? Pour introduire de la stabilité en ne tenant pas compte de voisins instables ou fortement mobiles, pour fédérer l'ensemble des noeuds, pour introduire une hiérarchie dans le réseau afin de faciliter le passage à l'échelle, pour introduire plus de capacité dans le réseau, etc. L'auto-organisation telle que nous la considérons vise à construire une topologie logique basée sur la topologie physique de telle sorte que les protocoles réseaux (routage, inondation, etc.) et applicatifs (agrégation et dissémination de données) soient plus efficace et plus robuste. La littérature propose essentiellement 4 façons de structurer un réseau en ayant recours aux tables de hachage distribuées (DHT), aux stratégies de clustering, à la construction d'overlays ou en construisant un réseau maillé logique. Bien entendu, il s'agit ici de proposer des protocoles localisés, voire distribuées. Dans nos travaux, nous avons proposé plusieurs algorithmes localisés de construction et de maintenance de backbone virtuel construit sous forme d'arbre ou de treillis. Après avoir étudié les propriétés intrinsèques de ces protocoles en termes de cardinalité, de convergence (auto-stabilisation), de complexité, etc. nous nous sommes intéressé à l'apport de ces structures logiques dans les problématiques réseaux. Ainsi, et que ce soit dans le domaine des réseaux ad hoc, des réseaux hybrides et des réseaux de capteurs, nous avons re-visité les principaux défis posés en développant des protocoles basés sur les auto-organisations proposées plutôt que de considérer le réseau à plat comme c'est souvent le cas. Des protocoles de routage unicast, de localisation, d'auto-configuration mais également de diffusion de données ont été proposés. L'ensemble des publications obtenues mettent en évidence la pertinence de cette démarche. A côté de ces travaux orientés réseaux nous avons montré, dans des travaux plus théoriques, l'apport en terme de stabilité que permettait l'auto-organisation notamment dans le cas de topologies fortement dynamique. Ce résultat est basé sur l'application de l'entropie statistique utilisée classiquement en thermodynamique. Ces travaux ont été menés depuis le point de vue théorique jusqu'à l'expérimentation.
Typical wireless sensor networks consist of sinks, events, and a large number of tiny, multifunctional and battery-powered sensor nodes. In Wireless Sensor Networks, data dissemination to multiple mobile sinks consumes a lot of energy. Various grid-based data dissemination schemes have been proposed over the years to reduce the energy consumption in Wireless Sensor Networks. Energy is one of the most important aspects for designing a data dissemination protocol for the applications such as battle-field monitoring, habitat monitoring etc. We present EEGBDD, a Novel Aware Data Dissemination scheme for randomly deployed wireless sensor networks. The proposed scheme is energy-efficient for handling both sink and source mobility. EEGBDD relies on virtual grid- based infrastructure for data dissemination from multiple mobile sources to multiple mobile sinks. Furthermore we proposed a diagonal forwarding algorithm for query and data forwarding which ensures that only one dissemination node forwards the query and data at a time. In EEGBDD, alternate dissemination nodes are selected in advance during grid construction process and minimum threshold energy level is defined for dissemination nodes. As soon as the energy of a dissemination node reaches to the minimum threshold value, it is replaced by an alternate dissemination node. The simulation results and theoretical analysis show that the proposed EEGBDD scheme performs better than the existing data dissemination schemes such as TTDD.
In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.
Searching for a sink and determining routing paths are challenging tasks in a mobile sink environment, especially in a location-free environment. Updating the sink location frequently by transmitting messages to preserve a route greatly increases the energy consumption of sensors. Therefore, methods to lower updating costs should be investigated. In this study, a cluster-based mobile sink exploration (CMSE) scheme is developed to guide data packets efficiently to mobile sinks. In this scheme, a source node can identify the sink location without knowledge of node locations, and multiple routing paths are established from a sensor to the sink to enhance network longevity. Simulation results show that compared with the use of previous methods, using the CMSE scheme helps save more energy and increases network longevity under various scenarios.
A Wireless sensor network is a area of investment and it can applied to various fields such as wild environment monitoring, industrial machine measurement, and military-purpose measurement to the daily application fields such as fire monitoring and pollution monitoring. Wireless sensor network consists of several sensor nodes deployed in a certain field. Information sharing occurs between sensor nodes within which loss of data can occur. To recover the loss different techniques we have to apply. Here we are describing the different techniques to achieve the loss recovery of data and estimate parameters of it.
Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.
With routing paths being modified after each sink movement, delivering data to a mobile sink in a wireless sensor network (WSN) can be a challenging issue. Updating the sink location with messages to maintain a route frequently could result in great energy consumption in the sensors. Moreover, the number of message collisions is proportional to the control overhead of the sink location update. This paper develops a RIpple Sink Exploration scheme, or RISE, to efficiently guide the data to the mobile sink. The source which generates the raw data explores the sink location with no knowledge of node locations. The design proposed in this paper allows for updating sink locations without any bottleneck affects. Simulation results show that the RISE scheme saves more energy than previous designs, achieving greater network longevity. Also, RISE can be applied to a multiple-sink scenario with a small updating cost.
Wireless Sensor Network (WSN) is a collection of sensor nodes able to sense their environment, collect and process various
data, and communicate among each other. The introduction of mobility of sensor nodes can significantly affect and improve
the overall network performances. Sensor nodes may move by self-driving (e.g. mounted on wheels) or by being attached to transporting
devices (e.g. robots, people, vehicles, or animals) resulting in longer network lifetime, better area coverage, and dynamic
adaptation to different system functionalities and requirements.
In Wireless Sensors and Actuators Networks (WSANs), actuator nodes are nodes richer in resources (processing capacity, power transmission and energy storage) and better suited than sensor nodes to process the data, make decisions based on sensed values and perform appropriate actions. In addition, in order to provide timely action, coordination between sensors and actuators is necessary. Thus, in addition to the classical energy constraints of Wireless Sensor Networks (WSNs), WSANs also impose new challenges such as how to support and benefit from the nodes heterogeneity while preserving energy in the self-powered sensor nodes. New communication protocols, specific to WSANs, are needed. In this paper, we propose a hybrid self-organizing data-collection protocol in order to provide energy efficiency, low end-to-end delay and high delivery ratio while taking advantage of the resource available on the actuators nodes in the network. This new self-organization protocol constructs its structure from the actuators and other resource-plentiful nodes. The nature of the structure is different inside and outside of transmission range of these resourceful nodes.
Due to recent development in wireless communication networks, researches in Vehicular Ad-hoc Networks (VANETs) have been getting much attention on information sharing and service discovery. However, due to the ever-shifting mobility of vehicle topology, vehicles moving in non-fixed routes may not find suitable next-hop vehicles to pass the data. This paper proposes schemes to effectively circulate and discover service information with the aid of public transportation systems. Bus routes can be used to create a backbone structure and data can be posted and circulated on the structure to avoid the broadcast storm problem. Moreover, by adopting the proposed architecture, the required data can be effectively disseminated and discovered through the traffic infrastructure and mobile vehicles. The experiment results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and end-to-end delay. Moreover, the overhead of our scheme outperforms other scheme with an increasing of number of service requests.
L'auto-organisation de réseaux radio multi-sauts a pour objectif de structurer/organiser un réseau à l'aide d'une structure logique. Pourquoi le structurer ? Pour introduire de la stabilité en ne tenant pas compte de voisins instables ou fortement mobiles, pour fédérer l'ensemble des noeuds, pour introduire une hiérarchie dans le réseau afin de faciliter le passage à l'échelle, pour introduire plus de capacité dans le réseau, etc. L'auto-organisation telle que nous la considérons vise à construire une topologie logique basée sur la topologie physique de telle sorte que les protocoles réseaux (routage, inondation, etc.) et applicatifs (agrégation et dissémination de données) soient plus efficace et plus robuste. La littérature propose essentiellement 4 façons de structurer un réseau en ayant recours aux tables de hachage distribuées (DHT), aux stratégies de clustering, à la construction d'overlays ou en construisant un réseau maillé logique. Bien entendu, il s'agit ici de proposer des protocoles localisés, voire distribuées. Dans nos travaux, nous avons proposé plusieurs algorithmes localisés de construction et de maintenance de backbone virtuel construit sous forme d'arbre ou de treillis. Après avoir étudié les propriétés intrinsèques de ces protocoles en termes de cardinalité, de convergence (auto-stabilisation), de complexité, etc. nous nous sommes intéressé à l'apport de ces structures logiques dans les problématiques réseaux. Ainsi, et que ce soit dans le domaine des réseaux ad hoc, des réseaux hybrides et des réseaux de capteurs, nous avons re-visité les principaux défis posés en développant des protocoles basés sur les auto-organisations proposées plutôt que de considérer le réseau à plat comme c'est souvent le cas. Des protocoles de routage unicast, de localisation, d'auto-configuration mais également de diffusion de données ont été proposés. L'ensemble des publications obtenues mettent en évidence la pertinence de cette démarche. A côté de ces travaux orientés réseaux nous avons montré, dans des travaux plus théoriques, l'apport en terme de stabilité que permettait l'auto-organisation notamment dans le cas de topologies fortement dynamique. Ce résultat est basé sur l'application de l'entropie statistique utilisée classiquement en thermodynamique. Ces travaux ont été menés depuis le point de vue théorique jusqu'à l'expérimentation.
We propose B-MAC , a carrier sense media access protocol for wireless sensor networks that provides a flexible interface to obtain ultra low power operation, effective collision avoidance, and high channel utilization. To achieve low power operation, B-MAC employs an adaptive preamble sampling scheme to reduce duty cycle and minimize idle listening. B-MAC supports on-the-fly reconfiguration and provides bidirectional interfaces for system services to optimize performance, whether it be for throughput, latency, or power conservation. We build an analytical model of a class of sensor network applications. We use the model to show the effect of changing B-MAC 's parameters and predict the behavior of sensor network applications. By comparing B-MAC to conventional 802.11-inspired protocols, specifically SMAC, we develop an experimental characterization of B-MAC over a wide range of network conditions. We show that B-MAC 's flexibility results in better packet delivery rates, throughput, latency, and energy consumption than S-MAC. By deploying a real world monitoring application with multihop networking, we validate our protocol design and model. Our results illustrate the need for flexible protocols to effectively realize energy efficient sensor network applications.
Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
In this paper we discuss the mechanism of multipoint relays (MPRs) to efficiently do the flooding of broadcast messages in the mobile wireless networks. Multipoint relaying is a technique to reduce the number of redundant re-transmissions while diffusing a broadcast message in the network. We discuss the principle and the functioning of MPRs, and propose a heuristic to select these MPRs in a mobile wireless environment. We also analyze the complexity of this heuristic and prove that the computation of a multipoin- t relay set with minimal size is NP-complete. Finally, we present some simulation results to show the efficiency of multipoint relays.
In this paper, a new data dissemination algorithm for wireless sensor networks is presented. The key idea of the proposed solution is to combine concepts presented in trajectory-based forwarding with the information provided by the energy map of the network to determine routes in a dynamic fashion, according to the energy level of the sensor nodes. This is an important feature of an autonomic system, which must have the capacity of adapting its behavior according to its available resources. Simulation results revealed that the energy spent with the data dissemination activity can be concentrated on nodes with high-energy reserves, whereas low-energy nodes can use their energy only to perform sensing activity or to receive information addressed to them. In this manner, partitions of the network due to nodes that ran out of energy can be significantly delayed and the network lifetime extended.
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The structure of a graph can be simplified using WCDS's and made more succinct for routing in ad hoc networks. The theoretical performance ratio of these algorithms is O(ln #) compared to the minimum size WCDS, where # is the maximum degree of the input graph. The first two algorithms are based on the centralized approximation algorithms of Guha and Khuller [14] for finding small connected dominating sets (CDS's). The main contribution of this work is a completely distributed algorithm for finding small WCDS's and the performance of this algorithm is shown to be very close to that of the centralized approach. Comparisons between our work and some previous work (CDS-based) are also given in terms of the size of resultant dominating sets and graph connectivity degradation.
We propose in this paper a low-energy self-organization scheme (LEGOS), a simple event-driven and leader-based self-organization. It provides and maintains a communication structure for wireless ad hoc sensor networks with low energy consumption. To achieve low power operation, LEGOS employs a quick join procedure with low message cost for newly arrived sensor nodes. The use of periodic Hello messages is avoided in the design of LEGOS, which has a strong impact on energy saving. LEGOS guarantees a low-cardinality dominating node set selection in the network. The resulting communication structure can adapt itself with the growth of the network service area. LEGOS is a completely localized algorithm. We also prove that LEGOS has low computation complexity and low message cost through simply analysis. Through simulations, we show that LEGOS provides up to 20% of extra energy savings compared to other self-organization schemes when using the same distributed MAC scheduling. Our results illustrate the need for simple and low-energy self-organization to effectively realize energy efficient sensor network applications
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the network. We consider both topology control and broadcast oriented protocols, for which all existing solutions require global network information. In this paper, we describe new localized protocols where nodes require only local informations about their neighborhood (distances or geographic positions). In addition to this, our protocols are shown experimentally to be comparable to the best known globalized BIP solution. Our solutions are based on the use of neighbor elimination scheme applied on the relative neighborhood graph (RNG) and local minimum spanning tree (LMST) which preserve connectivity and are defined in localized manner. Two variants are proposed, one with timeout applied on nodes receiving message from non-RNG (non-LMST) neighbor and retransmitting immediately otherwise (unless list of RNG or LMST neighbors in need of the message is empty), and one with timeout applied on all the nodes. We proved that LMST is a subset of RNG, which explains why LMST always performs better among the two.
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominat- ing set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dom- inating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances. Our simulation results show that the proposed approach outperforms a classical algorithm. Our approach can be potentially used in designing efficient routing algo- rithms based on a connected dominating set.
A connected dominating set (CDS) for a graph G(V,E) is a subset V1 of V, such that each node in V--V1 is adjacent to some node in V1, and V1 induces a connected subgraph. A CDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a CDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the CDS in the case of mobility and topology changes.In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a emph constant approximation ratio, and emph linear time and emph linear message complexity. This algorithm is fully localized, and does not depend on the spanning tree. Thus, the maintenance of the CDS after changes of topology guarantees the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its single-hop neighbors, and only a constant number of two-hop and three-hop neighbors. The message length is O( log n) bits.
Advances in processor, memory, and radio technology enable small and cheap nodes capable of sensing, communication, and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. We explore the directed diffusion paradigm for such coordination. Directed diffusion is data-centric in that all communication is for named data. All nodes in a directed-diffusion-based network are application aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network (e.g., data aggregation). We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally. Our evaluation indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (e.g., omniscient multicast) under the investigated scenarios.
Topology control in a sensor network balances load on sensor nodes, and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. In this paper, we propose a novel distributed clustering approach for long-lived ad-hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intra-cluster and inter-cluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diusion paradigm for such coordination. Directed diusion is datacentric in that all communication is for named data. All nodes in a directed diusion-based network are applicationaware. This enables diusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network. We explore and evaluate the use of directed diusion for a simple remote-surveillance sensor network. 1 Introduction In the near future, advances in processor, memory and radio technology will enable small and cheap nodes capable of wireless communication and signicant computation. The addition of sensing capability to such devices will make distributed microsensing|an activity in which a collection of ...
In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly reduce or eliminate the communication overhead of a broadcasting task by applying the concept of internal nodes. In the broadcasting task, retransmissions by only internal nodes is sufficient. Existing notions of internal nodes are improved by using node degrees instead of their ids as primary keys in internal node decisions. Some existing solutions apply retransmissions from each clusterhead or border node in a clustered structure. Highest node degrees are also proposed for reducing the number of clusterheads and border nodes in a clustering algorithm. We also propose to eliminate neighbors that already received the message, and re-broadcast only if the list of neighbors that might need the mess...