Learn More
In many-to-one wireless sensor networks, there exists an unbalanced power consumption problem; that is, nodes near the data sink or base station, called hot spots, have a high probability of forwarding a high amount of packets and die early. Most of previous work is dedicated to constructing a long-lived aggregation tree, while leaving the hot spot problem(More)
This paper has analyzed link probability, expected node degree, expected number of links, and expected area collectively covered by a finite number of nodes in wireless ad hoc networks. Apart from the formulation of exact mathematical expressions for these properties, we have disclosed two fundamental results: (1) Every possible link has an equal(More)
In recent years, the applications of wireless sensor networks have increased steadily. Sensor nodes are often scattered outdoors and their energy consumption depends heavily on the area of coverage and network topology. Many studies were focused on saving the energy of sensor nodes to maintain their functionality. This work aims at extending the lifetime of(More)
In this work, we propose a new routing protocol-the small-world routing protocol. With the idea originating from the small-world theory, the proposed protocol finds paths between the queries and events through recurrent propagations of weak and strong links. The operation of the protocol is simple and does not require much computational power. We evaluate(More)
The orthogonal variable-spreading-factor (OVSF)-CDMA systems can support multimedia applications with different bandwidth requirements. Code management schemes, including code placement and replacement, significantly impact the code utilization of the system. Many researches have studied these two closely related problems and are solving them independently.(More)
Collaborative charging schemes are indeed helpful for energy replenishment. However, classic and traditional collaborative charging schemes are still suffering from a series of severe problems, which are almost neglected. The lack of homogeneity and dynamic charging decisions on collaborative charging schemes in Wireless Rechargeable Sensor Networks (WRSN)(More)
In this work, without exploiting any location and distance information, distributed and randomized algorithms are devised for mitigating the un-coverage problem. These algorithms detect uncovered areas and redundant mobile sensor nodes, and direct them to move to cover the uncovered areas, only basing on the number of neighbors of each node by consuming a(More)
Pass-over in wireless sensor network routing occurs when a query agent passes over an event agent without discovering each other. Even if the two agents eventually meet, the number of hop count may add up as a result of that. In this paper we examine the pass-over problem extensively through numerical analysis and simulations. Numerical analyses (and(More)