-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we proposed a Power Saving Scheme (PSS) multi-hop sensor network using partition clusters. It avoids collision and idle listening time of sensor nodes for better overall network life time. The basic sensor nodes are simple and have limited power supplies, whereas the cluster head nodes are much more powerful and have many more power supplies, which organize sensors around them into clusters. Such two-layered heterogeneous sensor networks have better scalability and lower overall cost than homogeneous sensor networks. It is proposed that using polling to collect data from sensors to the cluster head since polling can prolong network life by avoiding collisions and reducing the idle listening time of sensors .The proposal focus on finding energy-efficient and collision-free pollingschedules in a multi-hop cluster. To reduce energy consumption in idle listening, a schedule is optimal if it uses the minimum time. It also considers dividing a cluster into sectors and using multiple non overlapping frequency channels to further reduce the idle listening time of sensor. We conducted simulations on the NS-2 simulator and theresults show that our polling scheme can reduce the active time of sensors by a significant amount while sustaining 100 percent throughput.
International Journal on Computer Science and Engineering. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, We identified several advantages of a heterogeneous archi¬tecture for wireless sensor networks (WSNs) .It consists of some re¬source rich mobile relay nodes and a many number of simple undynamic nodes. The mobile relays have high energy than the undynamic nodes. The mobile relays can dynamically move around the entire network and help relieve sensors that are highly burdened by heavy network traffic, thus improving the lifetime. We first analyze the performance of a large dense network with one mobile relay and show that network lifetime improves over that of a purely undynamic network by up to a factor of five. Also, the mobile relay needs to stay only within a two-hop radius of the sink. We then construct a AR (Aggregation Routing) Algorithm which gives a network lifetime close to the maximum limit. The benefit of this algorithm is that it only re¬quires a minimum number of nodes in the network to be known of the location of the relay. Our simulation results show that one mobile relay can at least improve the network lifetime in a randomly deployed WSN. By comparing the mobile relay approach with var¬ious undynamic energy-provisioning methods, we explain the im¬portance of node mobility for resource provisioning in a WSN.
International Journal of Computer Applications. 01/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Quality of Service (QoS) support for Mobile Ad hoc Networks (MANETs) is an exigent task due to dynamic topology and limited resource. To support QoS, the link state information such as delay, bandwidth, jitter, cost, error rate and node energy in the network should be available and manageable. The focus of this paper is extending the scope to QoS routing procedure, to inform the source about QoS available to any destination in the wireless network. However, existing QoS routing solutions were dealt with only one or two of the QoS parameters. It is important that MANETs should provide QoS support routing, such as acceptable delay, jitter and energy in the case of multimedia and real time applications. This paper proposes a QoS Dynamic Source Routing (DSR) protocol using Ant Colony Optimization (ACO) called Ant DSR (ADSR).The performance of DSR and ADSR are analyzed using network simulator-2. ADSR produces better results than the existing DSR in terms of delay, energy, jitter and throughput.
International Journal of Computer Science and Security. 01/2008;
