New spray and wait protocol with node activity in heterogeneous delay tolerant networks

The spray and wait protocol is a classic copy-limited spraying protocol in delay tolerant networks, in which, the binary spray mode can be improved for heterogeneous delay tolerant networks. In this article, a new conception of node activity was defined to weigh the importance of nodes in aspect of message dissemination in the whole network. A new spray and wait protocol with node activity was proposed to improve the performance in heterogeneous delay tolerant networks. A mathematical model used under varieties of the spraying protocols was also proposed to analyze the expected delay of the protocol. Simulations show that the spray token proportion with node activity is optimal and the new protocol is of better performance than other related protocols. Therefore, this protocol has high efficiency and good scalability.

Steadfast Energy Proficient Sensor Node Activation System in Wireless Networks Lifetime Enhancement

The wireless sensor network (WSN) is one of the budding exploring areas and fast rising fields in wireless communications. The sensor nodes in the network are generally small-size, low-cost, low-power and multi-function capabilities. Wireless sensor networks (WSNs) are used for various applications;since numerous sensor nodes are usually deployed on remote and inaccessible places, the employment and preservation should be easy and scalable. Sensor nodes in the field being run out of energy quickly has been an issue and many energy efficient routing protocols have been proposed to solve this problem and preserve the long life of the network. This paper work proposes a hierarchical based node activation routing technique which shows energy efficiency. This technique selects cluster head with highest residual energy in each communication round of transmission to the base station from the cluster heads. Hierarchical based node activation routing technique with different levels of hierarchy simulation results prolongs the lifetime of the network compared to other clustering schemes and communication rounds of simulation increase significantly.

Resources Management in Active Networks

In an active network, users can insert customized active codes into activenodes, to execute. Thus it needs more resources than those required by conventional networks, andthese resources must be effectively monitored and managed. Management policies in existing OSs aretoo complicated to apply to simple active packets. In this paper, we present new resourcesmanagement policies that are mainly adoped to manage CPU, storage and transmission bandwidth.Namely, we use SPF algorithm to schedule and process active packets, and import an interval queuemethod to allocate transmission bandwidth, and use feedback mechanism to control congestion . At thesame time, we design some experiments on prototype systems with and without resources managementpolicies respectively. The experiments results show that management policies presented by us caneffectively manage resources in active nodes and can improve the performance of active networks.