Effect Of Node Density Research Articles

Effect of Node Density over the performance of DSR, TORA, and OLSR Routing Protocols of MANET

Effect of Node Density over the performance of DSR, TORA, and OLSR Routing Protocols of MANET

Implementation and comparison of two intelligent systems based on fuzzy logic for actor selection in WSANs: effect of node density on actor selection

Wireless sensor and actor network (WSAN) is formed by the collaboration of micro-sensor and actor nodes. Whenever there is any special event, i.e., fire, earthquake, flood or enemy attack in the network, sensor nodes are responsible to sense it and send information towards an actor node. The actor node is responsible to take prompt decision and react accordingly. In this work, we propose and implement two fuzzy based actor selection systems (FBASS): FBASS1 and FBASS2 for actor selection in WSANs. The systems decide whether the actor will be selected for the required job or not based on data supplied by sensors and actual actor condition. We evaluated the proposed system by computer simulations. Comparing FBASS1 with FBASS2, the FBASS2 is more complex than FBASS1, because it has more rules in fuzzy rule base (FRB). By increasing node density, the FBASS2 can save better the energy.

Implementation and comparison of two intelligent systems based on fuzzy logic for actor selection in WSANs: effect of node density on actor selection

Wireless sensor and actor network (WSAN) is formed by the collaboration of micro-sensor and actor nodes. Whenever there is any special event, i.e., fire, earthquake, flood or enemy attack in the network, sensor nodes are responsible to sense it and send information towards an actor node. The actor node is responsible to take prompt decision and react accordingly. In this work, we propose and implement two fuzzy based actor selection systems (FBASS): FBASS1 and FBASS2 for actor selection in WSANs. The systems decide whether the actor will be selected for the required job or not based on data supplied by sensors and actual actor condition. We evaluated the proposed system by computer simulations. Comparing FBASS1 with FBASS2, the FBASS2 is more complex than FBASS1, because it has more rules in fuzzy rule base (FRB). By increasing node density, the FBASS2 can save better the energy.

TinyIBAK: Design and Prototype Implementation of An Identity-based Authenticated Key Agreement Scheme for Large Scale Sensor Networks

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

Battery-aware Routing in Personal Networks

A personal network (PN) is a network of devices belonging to a person. It can consist of a number of ad hoc sub-networks which are linked together through the Internet. We study battery-aware routing for multi-hop connectivity in sub-networks of PNs, and propose a new algorithm. The proposed algorithm takes the advantage of having mains-connected devices in a PN to direct the traffic to such devices and avoid relaying over nodes with low battery energy. A consequence of this strategy is directing the traffic load to static nodes of the network as well, since mains-connected nodes are static while battery-powered nodes could be mobile. This results in less route failures due to less mobility of nodes along a chosen path. We comprehensively compare the performance of our proposed algorithm with the performance of some well-known algorithms from the literature. We consider the effect of node density, routing overhead, heterogeneity of nodes in terms of their power supplies, gateway-oriented communication, mobility of nodes, and transmission power control, on the performance of battery-aware routing algorithms in PNs. Taking into account various parameters and different scenarios, we show that directing the traffic to mains-powered nodes can profoundly increase operational lifetime of the network. Our algorithm, as well as the results of our work, can also be applied to other types of ad hoc networks with heterogeneous power supplies.

Analyzing the Effect of Node Density on the Performance of the LAR-1P Algorithm

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detailed analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones were computed to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.

Evaluating voice traffic requirements on IEEE 802.11 ad hoc networks

This paper analyzes voice transmission capacity on IEEE 802.11 ad hoc networks by performing simulations related to delay, jitter, loss rate, and consecutive losses. We evaluate the influence of mobility on the number of sources transmitting voice. Another issue addressed in this paper is the effect of node density on voice transmission. Our simulation model has allowed us to identify the main reasons for voice degradation in ad hoc networks. Results show that voice transmission capacity degrades with mobility and network load, being more sensitive to high mobility due to link failures. The network capacity can easily experience a decrease of up to 60% on the number of voice transmissions on a multi-hop environment. We also show that node density is also relevant when considering voice transmission on multi-hop networks.

Uma Avaliação da Capacidade de Transmissão de Voz em Redes 802.11 no Modo Ad-Hoc

Tills paper analyzes voice transmission capacity on ad hoc networks by performing simulations related to delay, jitter, loss rate, and consecutive losses. We evaluatethe influence of mobility and quality of service provisioning on the number of voice transnlitting sources. Another issue addressed in this paper is the effect of node density in voice transmission. Results show that we can achieve up to 22% ofimprovement in the capacity of voice transmission when the medium access time is reduced by service differentiation on the MAC layer. Moreover, mobility and network load variations can degrade up to 60% the network capacity of voice transmission, mainly on multihop mobile networks.