scholarly journals Ad-Hoc on Android using Wi-Fi Direct

Starting with API level 14, ICECREAM SANDWITH, Android introduced API for peer to peer communication using Wi-Fi Direct. Since then many applications have been released that use this technology for data transfer and communication between two devices. But most of these have been used for just two-person communication. In this paper we propose to create a peer to peer network using the same technology. This paper focuses on creating a local wireless network of android smartphones using Wi-Fi direct. This paper also defines an algorithm using which each device can get the IP address of each of its peer. This paper will also help those who are trying to create applications on android using Wi-Fi Direct.

Mobile ad hoc networks as an infrastructure free, and constrained resource environment network. The network aim is to establish internet connectivity everywhere regardless of location. The applications of network are healthcare, disaster relief and military, where reliable communication is major concern. Communication in the network is initiated by establishing the communication route between source and destination and sending the information through it. One of the characteristics of MANETs is a peer-to-peer network, where intermediate nodes have to cooperate for reliable communication by acting as routers. In literature number of routing protocols have been designed based on the MANET’s peer to peer characteristic. However, it may not be every time true that the intermediate nodes act as faithful routers, and they may untrustworthy either due to malicious behavior or bottleneck. Number of secure protocols have been designed to mitigate malicious behavior by neglecting the bottleneck. The paper aims to define the bottleneck, and its importance in communication. Finally, how bottleneck influence on the MANETs performance during malicious nodes mitigation


Author(s):  
DIPTI GOGAWALE ◽  
MADHURI WAKODE

The Peer to peer architecture run over internet are widely used in unstructured topology. Random walk based and control flooding resource query algorithms are widely used in peer to peer network. In this paper we consider searching of file in ad hoc network. We propose Enhanced Selective Dynamic Query algorithm. The main aim of this algorithm is to minimize traffic cost and response latency for resource query response. When user want to search a query first history table is referred. If query is present in history table next searching is not required otherwise optimal combination of integer TTL value and set of neighbor for next query round is calculated in network by using knapsack for next query. This algorithm tries to achieve best tradeoff between traffic cost and response latency.


Author(s):  
Petros Mashwama ◽  
Stephen Gbenga Fashoto ◽  
Elliot Mbunge ◽  
Simanga Gwebu

<h1>Mobile Inter-vehicular communication network is an ad hoc network that allows peer vehicles to share and receive data. The existing inter-vehicular communication approach uses data from a limited number of data sources located in distant areas. This leads to high latency caused by the short-range antennas used to connect the peers. Inter-vehicular networks are dynamic and self-organized networks that do not use any external infrastructure to send and receive data. Currently, inter-vehicular networks only exist as part of a hybrid system and hence there is a need for a faster inter-vehicular network which can function independently. In this study, we developed a model which uses the gossip algorithm to send and receive data. The results show that over time, in a peer-to-peer network, the distance to be covered and the delay time are reduced. In the current models, however, the delay and distance covered remain constant. The results show that a peer-to-peer model is faster.</h1><p> </p>


2014 ◽  
Vol 24 (8) ◽  
pp. 2132-2150
Author(s):  
Hong-Yan MEI ◽  
Yu-Jie ZHANG ◽  
Xiang-Wu MENG ◽  
Wen-Ming MA

2013 ◽  
Vol 9 ◽  
pp. 215-225 ◽  
Author(s):  
Tadeu Classe ◽  
Regina Braga ◽  
Fernanda Campos ◽  
José Maria N. David

Sign in / Sign up

Export Citation Format

Share Document