11 resultados para mobility aware metrics

em Cochin University of Science


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Wireless sensor networks monitor their surrounding environment for the occurrence of some anticipated phenomenon. Most of the research related to sensor networks considers the static deployment of sensor nodes. Mobility of sensor node can be considered as an extra dimension of complexity, which poses interesting and challenging problems. Node mobility is a very important aspect in the design of effective routing algorithm for mobile wireless networks. In this work we intent to present the impact of different mobility models on the performance of the wireless sensor networks. Routing characteristics of various routing protocols for ad-hoc network were studied considering different mobility models. Performance metrics such as end-to-end delay, throughput and routing load were considered and their variations in the case of mobility models like Freeway, RPGM were studied. This work will be useful to figure out the characteristics of routing protocols depending on the mobility patterns of sensors

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is hoped that the present study by analysing the dynamics of agrarian change and peasant mobility may contribute to the on-going debate on this issue in India and other developing countries. It may also help to throw light on the validity of some of the theories formulated on the basis of experience in different regions and at different times. The study is likely to be of special importance as it covers an area which has one of the highest densities of population. The area has also witnessed sweeping changes in agrarian structure as a result of the most radical land reforms among the Indian states.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study was aimed at to characterize the spatio-temporal trends in the distributional characteristics of various species of nitrogen and phosphorus as well as to elucidate the factors and processes aflecting these nutrients in the dissolved, particulate and sedimentary phases of a river estuarine system. The main area of study is Chalakudy river in Kerala, which is a fresh water system originating from Anamalai hills and ending at Arabian Sea. Its basin is between I00 05 ’ to I00 35’ North latitude and 76” 15 ’ to 760 55’ East longitude. Being a riparian bufler zone, the dynamics of nutrient mobility tend to be more complex and variable in this river-estuarine system.The diflerent species of nitrogen estimated from the filtrate were nitrite-N, nitrateN, ammonia-N, urea-N, total nitrogen and residual nitrogen. The diflerent forms of phosphorus estimated from the filtrate were phosphate-P, total-P and residualP. Pre weighed sediments as well as particulate matter were analysed for quantijying nitrite-N, nitrate-N, ammonia-N and urea-N. Total nitrogen was estimated after digestion with potassium persulfate. Fractionation of phosphorus in sediment/particulate matter was performed by applying sequential extraction procedure. The dijferent forms of phosphorus thus estimated were loosely bound (exchangeable) P, Fe/Al bound P, polyphosphates, Ca bound P and refractory P. Sedimental total P was also measured directly by applying digestion method.The analyses carried out in this bimonthly annual survey have revealed specific information on the latent factors influencing the water quality pattern ofthe river. There was dependence among the chemical components of the river sediment and suspended matter, reflecting the water quality. A period of profound environmental change occurred and changes in various species had been noted in association with seasonal variations in the waterway, especially following enhanced river runoff during the monsoon. The results also successfully represented the distribution trend of nutrients during the rainy as well as dry season. Thus, the information gathered in this work will also be beneficial for those interested or involved in river management, conservation, regulation and policy making in regional and national levels.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Clustering schemes improve energy efficiency of wireless sensor networks. The inclusion of mobility as a new criterion for the cluster creation and maintenance adds new challenges for these clustering schemes. Cluster formation and cluster head selection is done on a stochastic basis for most of the algorithms. In this paper we introduce a cluster formation and routing algorithm based on a mobility factor. The proposed algorithm is compared with LEACH-M protocol based on metrics viz. number of cluster head transitions, average residual energy, number of alive nodes and number of messages lost

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In Wireless Sensor Networks (WSN), neglecting the effects of varying channel quality can lead to an unnecessary wastage of precious battery resources and in turn can result in the rapid depletion of sensor energy and the partitioning of the network. Fairness is a critical issue when accessing a shared wireless channel and fair scheduling must be employed to provide the proper flow of information in a WSN. In this paper, we develop a channel adaptive MAC protocol with a traffic-aware dynamic power management algorithm for efficient packet scheduling and queuing in a sensor network, with time varying characteristics of the wireless channel also taken into consideration. The proposed protocol calculates a combined weight value based on the channel state and link quality. Then transmission is allowed only for those nodes with weights greater than a minimum quality threshold and nodes attempting to access the wireless medium with a low weight will be allowed to transmit only when their weight becomes high. This results in many poor quality nodes being deprived of transmission for a considerable amount of time. To avoid the buffer overflow and to achieve fairness for the poor quality nodes, we design a Load prediction algorithm. We also design a traffic aware dynamic power management scheme to minimize the energy consumption by continuously turning off the radio interface of all the unnecessary nodes that are not included in the routing path. By Simulation results, we show that our proposed protocol achieves a higher throughput and fairness besides reducing the delay

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.