A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Selvakumar, K.
- Analysis of Power-Aware and Stability Based On-Demand Routing Protocols for Mobile Ad Hoc Network
Authors
1 Department of CSE, Annamalai University, IN
Source
Wireless Communication, Vol 3, No 11 (2011), Pagination: 821-827Abstract
The Mobile Ad-Hoc Networks (MANETs) are wireless networks where a collection of mobile nodes may dynamically vary the topological structure. The design of efficient routing protocols is a fundamental problem in MANETs. Stability-based routing and Power-aware routing protocols are simulated. In this paper the Flow-Oriented Routing Protocol (FORP), Min-Max Battery Cost Routing (MMBCR) as representatives of the Stability-based routing and Power-aware routing respectively. FORP incurs the least number of route transitions, its tends to repeatedly use nodes lying on the stable path. MMBCR is most fair in terms of node usage and minimum energy consumed by per data packet whereas FORP incurs maximum energy consumed by per data packet. FORP gives higher values of packet delivery fraction. A high value of PDF indicates that most of the packets are being delivered to the higher layers and is a good indicator of the protocol performance. MMBCR make minimum use of power control by conserving the battery charge at the nodes while transferring data packets. Compared to that of the FORP, MMBCR have the smallest hop count and lowest end-to-end delay per data packet. The simulation of these protocols has been carried out by using NS-2 simulator. Five different simulation scenarios are generated and maximum node speed has been varied and other network parameters are kept constant during the simulation. The main objective of this paper is to implement the FORP and MMBCR and compare the performance metrics of route transitions, end-to-end delay, energy and packet delivery fraction.Keywords
AODV Protocol, DSR Protocol, FORP, MMBCR, and Wireless Network.
- An Efficient Method for Preventing Mobile Tracing Using Motion-Mix Over Mobile Wireless Nodes
Authors
1 Department of Computer Science & Engineering, Annamalai University, Annamalainagar – 608 002, Tamil Nadu, IN
Source
Wireless Communication, Vol 3, No 12 (2011), Pagination: 902-907Abstract
Providing security and privacy in mobile ad hoc networks has been a major issue over the last few years. It is more challenging due to advances in techniques of eavesdropping, locating and fingerprinting wireless transmissions. In particular, the mobile ad hoc networks are vulnerable to passive attacks that threaten the privacy of communications. In this paper, we first investigate the emerging threat of venue privacy attacks (VPAs) to trace mobile wireless nodes. We then propose motion-mix as the solution. The motion-mix is a geographic area in which the relation between nodes is hidden. The motion-mix provides protection at all the layers of the protocol stack. The necessary conditions to implement motion-mix are then studied. We further verify the effectiveness of motion-mix against venue privacy attack using a simulated network security model. We prove that the probability of security breach is negligible with respect to the polynomial-bounded network scale. This notion is conforming to the existing security notions in computational cryptography, where the polynomial-bounded metric is key length.Keywords
Anonymity, Motion-Mix, VPA, MANET, Mobile Tracing, Security.- Sensor Node Failure Detection Using Round Trip Delay and Paths in WSNs
Authors
Source
Wireless Communication, Vol 8, No 6 (2016), Pagination: 254-256Abstract
In recent years, applications of Wireless Sensor Networks (WSNs) have been increased due to its vast potential to connect the physical world to the virtual world. Also, an advance in microelectronic fabrication technology reduces the cost of manufacturing portable wireless sensor nodes. It becomes a trend to deploy the large numbers of portable wireless sensors in WSNs to increase the Quality of Service (QoS). The QoS of such WSNs is mainly affected by the failure of sensor nodes. Probability of sensor node failure increases with increase in number of sensors. In order to maintain the better QoS under failure conditions, identifying and detaching such faults are essential. In the proposed method, faulty sensor node is detected by measuring the Round Trip Delay (RTD) time of discrete round trip paths and comparing them with threshold value. Scalability of proposed method is verified by simulating the WSNs with large numbers of sensor nodes in NS2. The RTD time results derived in hardware and software implementations are almost equal, justifying the real time applicability of the investigated method. Necessity of received signal strength measurement in cluster head variation and assigning separate wavelength for each link in other fault detection techniques are overcome here.