On Providing Temporal Full-Coverage by Applying Energy-Efficient Hole-Movement Strategies for Mobile WSNs

[[abstract]]This paper considers a mobile WSN that contains a big hole but there exists no redundant mobile sensor to heal the hole. To achieve the temporal full-coverage purpose or enhance the tracking quality, three distributed algorithms are proposed for moving the existing big coverage hole to a predefined location. Firstly, the sink chooses a promising direction for hole-movement. Then the basic, forward-only and any-direction movement mechanisms are proposed to move the hole along the promising direction in a manner of minimizing the total power consumption or balancing the energy consumption of the given WSN. Simulation results reveal that the proposed hole-movement mechanisms enhance the coverage of WSN and balance the energy consumption of mobile sensor nodes.[[conferencetype]]國際[[conferencedate]]20070311~20070315[[iscallforpapers]]Y[[conferencelocation]]Kowloon, Hong Kon

OFRD:Obstacle-Free Robot Deployment Algorithms for Wireless Sensor Networks

[[abstract]]Node deployment is an important issue in wireless sensor networks (WSNs). Sensor nodes should be efficiently deployed in a predetermined region in a low cost and high coverage quality manner. Random deployment is the simplest way for deploying sensor nodes but may cause the unbalanced deployment and therefore increase the hardware cost. This paper presents an efficient obstacle-free robot deployment algorithm, called OFRD which involves the design of node placement policy, snake-like movement policy, and obstacle handling rules. By applying the proposed OFRD, the robot rapidly deploys near-minimal number of sensor nodes to achieve full sensing coverage even though there exist unpredicted obstacles. Performance results reveal that OFRD outperforms the existing robot deployment mechanism in terms of power conservation and obstacle resistance, and, therefore achieves a better deployment performance.[[incitationindex]]Y[[conferencetype]]國際[[conferencedate]]20070311~20070315[[conferencelocation]]Kowloon, Hong Kon

Dynamic Route Sharing Protocol for Wireless Sensor Networks

[[abstract]]A wireless sensor networks (WSN) comprises of a large number of sensor nodes and a few sink nodes. When multiple sink nodes are interested in collecting the readings of the same monitoring region, itpsilas conducive to exploit the sharing route in order to save bandwidth and power consumption and prolong WSNpsilas lifetime. This paper proposes a dynamic route sharing protocol (DRSP) which constructs sharing routes based upon different attributes (for example, frequency, packet length or delay time) of the commands requested from different sink nodes. The proposed DRSP dynamically adjusts data transmission route to achieve the goals of routes sharing and route length reduction. Simulation study shows that DRSP saves more energy and bandwidth consumptions than the existing work and thus prolongs the WSNpsilas lifetime.[[conferencedate]]20080731~20080801[[iscallforpapers]]Y[[conferencelocation]]Lanzhou, Chin

Obstacle-free geocasting protocol for ad hoc wireless networks

[[abstract]]Mobile ad hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocol for sending short message from a source host to a geocasting region in ad hoc networks. The proposed protocol keeps messages away from unpredictable obstacles and creates a small flooding region. Experimental results show that a source host can send a short message to all hosts located in geographical area with a high success rate and low flooding overhead.[[conferencetype]]國際[[conferencedate]]20030320~20030320[[iscallforpapers]]Y[[conferencelocation]]New Orleans, LA, US

WRGP: Weight-Aware Route Guiding Protocol for Wireless Sensor Networks with Obstacles

[[conferencetype]]國際[[conferencelocation]]Beijing, Chin

Energy-Efficient Mechanisms for Coverage Recovery in WSNs

[[abstract]]In wireless sensor networks (WSNs), coverage of the monitoring area represents the quality of service (QoS) related to the surveillance. In literature, a number of studies developed robot deployment and patrol algorithms. However, the efficiency of existing repair algorithms can be further improved in terms of time and energy consumption. Moreover, existing repair algorithms did not consider the existence of obstacles and the constraint of limited energy of the robot. This paper presents novel tracking mechanism and robot repairing algorithm for maintaining the coverage quality for a given WSN. Without the support of location information, the tracking mechanism leaves the robot's foot marks such that sensors that are nearby the failure region can learn better routes for sending repairing requests to the robot. Upon receiving several repairing request messages, the robot applies the proposed repairing algorithm to establish an optimal route that passes through all failure regions with minimal overhead in terms of the required time and power consumption. In addition, the proposed repairing algorithm also considers the remaining energy of the robot so that the robot can be back to home for recharging energy and overcome the unpredicted obstacles. Performance study reveals that the developed protocol can efficiently maintain the coverage quality while the required time and energy consumption are significantly reduced.[[conferencetype]]國際[[conferencedate]]20080806~20080808[[iscallforpapers]]Y[[conferencelocation]]Crete Island, GREEC

An Efficient Scheduling Algorithm for Maximizing Throughput in WiMAX Mesh Networks

[[abstract]]WiMAX Mesh Network architecture is defined in IEEE 802.16 for increasing the network coverage and improving the communication performance. In the past few years, many greedy or heuristic approaches have been proposed to cope with the scheduling problem in WiMAX mesh networks. However, their performances highly depend on the network topology and the bandwidth requests and none of them achieves optimal for all cases. This paper proposes an efficient scheduling algorithm that exploits the opportunities of spatial reuse and maximize the network throughput based on the network topology and the uplink transmission requests of each Subscriber Station(SS). Simulation study reveals that the proposed efficient scheduling algorithm provides the WiMAX mesh network with maximal throughput and shortest transmission time.[[conferencetype]]國際[[conferencedate]]20090621~20090624[[booktype]]紙本[[conferencelocation]]Leipzig, German