Data Dissemination In Sensor Networks Research Articles

Gossiping with Message Splitting on Structured Networks

Gossiping of a single source with multiple messages (by splitting information into pieces) has been treated only for complete graphs, shown to considerably reduce the completion time, that is, the first time at which all network nodes are informed, compared with single-message gossiping. In this paper, gossiping of a single source with multiple messages is treated, for networks modeled as certain structured graphs, wherein upper bounds of the high-probability completion time are established through a novel “dependency graph” technique. The results shed useful insights into the behavior of multiple-message gossiping and can be useful for data dissemination in sensor networks, multihopping content distribution, and file downloading in peer-to-peer networks.

Security Services for DoS, Hello Flooding and Traffic Analysis in WSN Using Mobile Agents

Sensor networks are dense wireless networks of small, low-cost sensors, which collect and disseminate environmental data. Wireless Sensor Networks have many characteristics that make them very vulnerable to malicious attacks. Lot of security algorithms were implemented to provide security system of WSN. Still it is an open area to research. Because, It is difficult to perform continuous surveillance after network deployment since WSN is usually deployed in hostile areas without any fixed infrastructure. Recently, mobile agents have been proposed for efficient data dissemination in sensor networks. In the traditional client/server-based computing architecture, data at multiple sources are transferred to a destination; whereas in the mobile-agent based computing paradigm, a task specific executable code traverses the relevant sources to gather data. Mobile agents can be used to greatly reduce the communication cost, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor. Here a mobile agent paradigm is proposed for implementing security system against hello flooding, Path based Denial of Service attack and traffic analysis.

Multiple Criteria Clustering of Mobile Agents in WSN

In Wireless sensor networks data aggregation with hundreds and thousands of sensor nodes is very complex task. Recently, mobile agents have been proposed for efficient data dissemination in sensor networks. In the traditional client/server based computing architecture, data is collected from multiple sources and forwarded to destination for further processing. It requires high bandwidth, whereas in the mobile agent is a task specific executable code traverses to the relevant source for gathering data. It reduces communication overhead, reduce cost, low bandwidth. Agents have capability to perform task for multiple applications. It will send only useful information to destination node. The problem is to group similar mobile agents into a number of clusters such that each cluster has similarity in responding to a group of nodes. By clustering intelligent mobile agents, it is possible to reduce the cost of time for each individual agent, decrease the demand imposed on network for a set of required tasks, decrease total number of visits. This paper, we present the problem of Multiple Criteria Clustering of Mobile Agents (MCCMA) where the decision is to cluster mobile agents such that a group of similar intelligent mobile agents will visit a group of similar sensor nodes.

Base Station Placement for Effective Data Dissemination in Sensor Networks

Base Station Placement for Effective Data Dissemination in Sensor Networks

Base Station Placement for Effective Data Dissemination in Sensor Networks

Reprogramming sensor nodes is important for managing sensor networks. The latest reprogramming protocols use radio communication to distribute software data. In multi-base station sensor networks, the placement of the base stations affects several wireless reprogramming performance metrics. We developed a method for placing base stations, and we evaluated the features of software dissemination for multi-base station sensor networks. Simulations showed that the placement and number of base stations and the number of data segments were the key parameters in software dissemination.

Fermat point based data dissemination in sensor networks

Disseminating data from multiple sources to multiple sinks is a very important application in sensor networks. In this paper, we present a new data dissemination scheme which uses the concept of the Fermat Point to construct a dissemination tree from one source (the root) to multiple sinks (the leaves). By sending data along the dissemination tree, the new scheme can conserve transmission energy, avoid collision and as a result reduce transmission delay. When sinks move, the proposed scheme can also adjust the dissemination tree topology to achieve high performance. Simulation runs are conducted to evaluate the performance of our new scheme and other related schemes, including Two‐Tier Data Dissemination (TTDD) and dynamic Delay‐constrained minimum‐Energy Dissemination (DEED). The collected result shows that our scheme can send data from a source to several sinks in a more efficient way and as a result saves more transmission energy and time than the other two schemes.

Spiral-based data dissemination in sensor networks

Data dissemination is a key problem that bottlenecks the wide application of Wireless Sensor Network (WSN). In this paper, a novel data dissemination scheme - Logarithmic Spiral Data Dissemination (LSDD) - is proposed. In LSDD, data advertisements are disseminated following a spiral-like path, which involve only a small fraction of nodes in a sensor network. By exploiting nice features of spiral, this scheme scales well for large sensor networks while prolonging the network lifetime. In numerical analysis and simulations, we show the distinct merits of LSDD as follows: lower dissemination cost (O√n) compared to that of flooding-based schemes (O√n), controllable topology by spiral parameters, excellent scalability, and good fault tolerance. We evaluate the extra delay caused by LSDD as a trade-off for its advantages, which is shown to be within a tolerable range.

Virtual Coordinates Based Routing in Wireless Sensor Networks

Recently, position-based routing protocols have been proposed for efficient data dissemination in sensor networks. Routing of packets is done based on the positions of nodes in the neighbor table. One node is selected as a next hop according to the applied routing strategy, e.g., distance-based strategy or direction-based strategy. This paper proposes a virtual coordinates based routing (VCR) scheme, which adopts a new criterion based on virtual coordinates converted from the absolute coordinates. The results of extensive simulation experiments show that VCR achieves an efficient trade-off between energy consumption and end-to-end delivery latency. The overall performance of VCR in terms of energy consumption and end-to-end delivery latency is better than that of both conventional distance-based and direction-based algorithms.

Mobile Agent Based Wireless Sensor Networks

Recently, mobile agents have been proposed for efficient data dissemination in sensor networks. In the traditional client/server-based computing architecture, data at multiple sources are transferred to a destination; whereas in the mobile-agent based computing paradigm, a task specific executable code traverses the relevant sources to gather data. Mobile agents can be used to greatly reduce the communication cost, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor. This paper proposes to use the mobile agent paradigm for reducing and aggregating data in a planar sensor network architecture. The proposed architecture is called mobile agent based wireless sensor network (MAWSN). Extensive simulation shows that MAWSN exhibits better performance than client/server communications in terms of energy consumption and the packet delivery ratio. However, MAWSN has a longer end-to-end latency than client/server communications in certain conditions.