Current Issue : January - March Volume : 2013 Issue Number : 1 Articles : 5 Articles
A mobile agent routing algorithm (MARA) is presented in this paper, and then based on the dual-channel communication model,\r\nthe two-layer network combination optimization strategy is also proposed. Since this strategy deals with the collision between\r\npackets and themulticast suppression in channel competitive process well, the blocking probability of network and the error rate of\r\npacket transmission can be cut down by utilizing this strategy. Furthermore, a restore rule for the failure optimal route is presented\r\ntoo. By using this rule, the optimal route can restore quickly in the local of fail nodes and most of the information of original\r\noptimal route can be reserved. Compared with other existing algorithms like ant colony optimization-based dynamic energyefficient\r\nmobile agent routing algorithm (ADEEMA) and mobile agent-based wireless sensor network (MAWSN), simulation\r\nresults show that MARA performs better in improving the success rate of packet transmission and cutting down the delay of\r\ncommunication. The success rate of packet transmission is improved 15%. Simultaneously, this algorithm can keep the ant agents\r\naway from the nodes with less residual energy in searching for the optimal route. This way can make the energy of each nodes on\r\nthe optimal route overall decline and hence improve the lifetime of network....
To prolong the lifetime of a wireless sensor network, one common approach is to dynamically schedule sensors� active/sleep cycles\r\n(i.e., duty cycles) using sleep scheduling algorithms. The connected K-neighborhood (CKN) algorithm is an efficient decentralized\r\nsleep scheduling algorithm for reducing the number of awake nodes while maintaining both network connectivity and an ondemand\r\nrouting latency. In this paper, we investigate the unexplored energy consumption of the CKN algorithm by building a\r\nprobabilistic node sleep model, which computes the probability that a random node goes to sleep. Based on this probabilistic\r\nmodel, we obtain a lower epoch bound that keeps the network more energy efficient with longer lifetime when it runs the CKN\r\nalgorithm than it does not. Furthermore, we propose a new sleep scheduling algorithm, namely, Energy-consumption-based CKN\r\n(ECCKN), to prolong the network lifetime. The algorithm EC-CKN, which takes the nodes� residual energy information as the\r\nparameter to decide whether a node to be active or sleep, not only can achieve the k-connected neighborhoods problem, but also\r\ncan assure the k-awake neighbor nodes have more residual energy than other neighbor nodes in current epoch....
Mobile agent (MA) systems provide new capabilities for energy-efficient data processing by flexibly planning its itinerary for\r\nfacilitating agent-based data collection and aggregation. In this paper, we present a cooperative data processing algorithm based\r\non mobile agent (MA-CDP), and considers MA in multihop environments and can autonomously clone and migrate themselves in\r\nresponse to environmental changes. MA accounts for performing data processing and making data aggregation decisions at nodes\r\nrather than bringing data back to a central processor, and redundant sensory data will be eliminated. The results of our simulation\r\nshow that MA-based cooperative data processing provides better performance than directed diffusion in terms of end-to-end\r\ndelivery latency, packet delivery ratio, and energy consumption....
Wireless sensor networks (WSNs) are widely used in battle fields, logistic applications, healthcare, habitat monitoring,\r\nenvironmental monitoring, home security, and variety of other areas. The existing routing algorithms focus on the delivery of data\r\npackets to the sink using the shortest path; however, calculating the shortest path is not a cost-effective solution while disseminating\r\ndatasets of interest to the nearest sink node. The approach presented in this paper extends the existing PBR (priority-based routing)\r\nprotocol by providing a new fault-tolerant multipath priority-based routing (FT-MPPBR) scheme, which not only balances the\r\nenergy consumption while selecting multiple paths but also balances the workload of the node closest to the sink. The nodes closer\r\nto the sink dissipate more energy and can become the source of a communication bottleneck. Simulation results for the proposed\r\nrouting scheme are encouraging and clearly show that the FT-MPPBR has outperformed the existing PBR schemes in terms of\r\nprolonging the network lifetime and reliability. In healthcare sensor networks, timely dissemination of datasets is critical for the\r\nwell-being of a patient. This research further extends the PBR architecture for supporting computational intensive analysis by\r\ntransferring datasets of interest to the sensor grid node for improved communication and better throughput....
Wireless sensor networks (WSNs) comprising of tiny, power-constrained nodes are gaining popularity due to their potential use\r\nin a wide range of applications, including monitoring of environmental attributes, intrusion detection, and various military and\r\ncivilian environments. While the sensing objectives of these environments are unique and application dependent, a common\r\nperformance criteria for wireless sensor networks is prolonging network lifetime while satisfying coverage and connectivity in\r\nthe deployment region. In many real-world scenarios, reoccurring spatial patterns of occurrence could be identified in the sensed\r\nevent information. This paper proposes a new routing algorithm schema based on event occurrence history to secure K-Coverage\r\nof event paths and maintain the maximum degree of coverage. In the proposed method the nodes located around event path\r\ntry to save their battery power by not participating in data packet forwarding to neighbor nodes. The simulation results show\r\nthat the proposed method improves network lifetime by shifting the routing responsibility from sensing nodes to communication\r\nnodes, while maximizing the degree of coverage in the main path of event occurrence. As a consequence, the lifetime of main path\r\ncoverage is increased dramatically as compared to previous methods....
Loading....