Sensor networks have many applications, a typical setting is in nature environment monitoring, such as forest fire, tsunami, and earthquake. In order to be easily deployed in this environment, sensor device is design ...
详细信息
Sensor networks have many applications, a typical setting is in nature environment monitoring, such as forest fire, tsunami, and earthquake. In order to be easily deployed in this environment, sensor device is design to have small form factor, and as lightweight as possible, thus, its battery capacity is limited. The issue of battery capacity is more important when applied in tracking moving objects, and when real time response of the system is critical where the routing algorithm do not need to perform data aggregation. This paper proposed a routing algorithm for tracking objects and perform emergency reporting when a situation occurred and at the same time reducing total energy consumption and thus prolonging the system lifetime. Our algorithm is called sensor on demand betweenness vector(SOBV). This algorithm is a multipath routing algorithm based on the characteristics of network topology.
In large scale deployment of wireless sensor networks,nodes transmitted sensed data through multi-hop to Sink, Thearea near the Sink forms energy hole due to heavy load. Nonuniform node distribution can effectively so...
详细信息
Kademlia is a famous routing algorithm based on distributed hash table and it established a new topological relation in P2P network. However, some shortages in searching efficiency and the strategy of cache need to so...
详细信息
The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not b...
详细信息
The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node s1, s2 (need not be distinct) in S such that {pipe}d(x:,s1) - d(y, s1){pipe} ≥ 1 and d(x,S2) N,dD, Maximum memory space requirement for the networkMSlmuac(Δi) LMUACH3Lnc and Maximum Link utilization factor MLLMUAC(i=j) LMUAC(i≠j)nc.
Dynamic wireless sensor networks (DWSN) break out the limit that both nodes and sinks are static in traditional wireless sensor networks, thereby prolong network lifetime. DWSN is very practical and gradually become a...
详细信息
Dynamic wireless sensor networks (DWSN) break out the limit that both nodes and sinks are static in traditional wireless sensor networks, thereby prolong network lifetime. DWSN is very practical and gradually become a key issue in the study of wireless sensor networks. In this paper, research background, classification standards, main schemes as well as routing are introduced, and many typical routing schemes and algorithms are analyzed and compared. Then some features that good models and routing should possess are summarized. Finally, we present several future research trends.
In this paper a novel adaptive load balancing routing algorithm in Ad hoc networks based on a gossiping mechanism is proposed. Unlike previously published algorithms, this algorithm adjusts the forwarding probability ...
详细信息
In this paper a novel adaptive load balancing routing algorithm in Ad hoc networks based on a gossiping mechanism is proposed. Unlike previously published algorithms, this algorithm adjusts the forwarding probability of the routing messages adaptively, according to the load status and the distribution of the nodes in the phase of route discovery. The simulation results show that the algorithm significantly reduces the routing overhead, and balances the load effectively.
The paper compares existing algorithms of choice of LSPs in IP networks with MPLS protocol and proposes a new algorithm, which is an improved version of the Least Interference routing Algorithm. The study showed that ...
详细信息
Epidemic routing offers a reliable approach to transmitting data in opportunistic networks, which has developed a few of variations so far. However, these algorithms have some redundant control overhead in sensing nei...
详细信息
Epidemic routing offers a reliable approach to transmitting data in opportunistic networks, which has developed a few of variations so far. However, these algorithms have some redundant control overhead in sensing neighbor nodes and exchanging data packets. To address the issue, we propose a high-efficiency low-delay routing algorithm based on exchange of increments in packet indexes. Our algorithm transmits only the increments of packet indexes in the process of packet exchange, sends the data packets approaching their destinations at first, and utilizes only Hello messages to sense encountered nodes. Theoretical analysis and simulation results show that our algorithm outperforms the classical Epidemic routing algorithm and one of its present improvements in terms of control overhead and end-to-end delay.
A Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multi hop wireless links without utilizing any fixed basedstation infrastructure and centralized management. ...
详细信息
A Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multi hop wireless links without utilizing any fixed basedstation infrastructure and centralized management. The topology of a MANET can be very dynamic due to the mobility of mobile nodes. Because of the dynamic topology and wireless link characteristics,the Quality of Service (QOS) support in mobile Ad hoc networks (MANETs) is a very challenging *** algorithm is a very important mechanism for QOS guaranteeing in networks. In this paper,we present a QOS routing algorithm,called QOS AODV (QAODV),which is an extension to the AODV protocol,we introduce more metrics in addition to the number of hops used by AODV protocol and we give a weight function using several parameters. The QAODV protocol selects optimal routes and also provides Quality of Service and fault *** obtained by a simulation show that QAODV allows obtaining some important advantages that makes it increases the throughput and decreases the delay and number of hops and also decreases the route discovery time.
The paper introduces a new method for improving quality of routing service in content delivery networks(CDN). The technology of jointing optimization of replica placement and distributed user request redirection is gi...
详细信息
ISBN:
(纸本)9781424480333
The paper introduces a new method for improving quality of routing service in content delivery networks(CDN). The technology of jointing optimization of replica placement and distributed user request redirection is given. In the model, different content has different latency bound requirements. The solution is dynamic in the sense that replicas are added and removed from content delivery networks servers according to the dynamically changing user request traffic. The results show that the proposed solution is capable of decrease access delay and improve the quality of service.
暂无评论