Special issue on “Modeling and Performance Evaluation of Wireless Ad-Hoc Networks”

A primary aim of wireless ad-hoc networks is to deliver data in areas where there is no pre-defined infrastructure. In these networks, the users, but also the network entities can be potentially mobile. Wireless ad-hoc networks have recently witnessed their fastest growth period ever in history. Real wireless ad-hoc networks are now implemented, deployed and tested, and this trend is likely to increase in the future. However, as such networks are increasingly complex, performance modeling and evaluation play a crucial part in their design process to ensure their successful deployment and exploitation in practice. This special issue on Modeling and Performance Evaluation of Wireless Ad-Hoc Networks aims to open a new critical debate on the evaluation of wireless ad-hoc networks. It includes original theoretical and/or practical contributions, from researchers and practitioners that identify and address issues in evaluating wireless ad-hoc networks.Peer ReviewedPostprint (author's final draft

A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks

In recent years, the proliferation of mobile computing devices has driven a revolutionary change in the computing world. The nature of ubiquitous devices makes wireless networks the easiest solution for their interconnection. This has led to the rapid growth of several wireless systems like wireless ad hoc networks, wireless sensor networks etc. In this paper we have proposed a framework for rural development by providing various e-services to the rural areas with the help of wireless ad hoc and sensor networks. We have discussed how timely and accurate information could be collected from the rural areas using wireless technologies. In addition to this, we have also mentioned the technical and operational challenges that could hinder the implementation of such a framework in the rural areas in the developing countries.Comment: 5 page

Approximating Minimum Independent Dominating Sets in Wireless Networks

We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded growth are used to characterize wireless communication networks, and this class of graph includes many models known from the literature, e.g. (Quasi) Unit Disk Graphs. An independent dominating set is a dominating set in a graph that is also independent. It thus combines the advantages of both structures, and there are many applications that rely on these two structures e.g. in the area of wireless ad hoc networks. The presented approach yields a robust algorithm, that is, the algorithm accepts any undirected graph as input, and returns a (1+")- pproximate minimum dominating set, or a certificate showing that the input graph does not reflect a wireless network

DISTRIBUTED INTELLIGENT SPECTRUM MANAGEMENT IN COGNITIVE RADIO AD HOC NETWORKS

The rapid growth of the number of wireless devices has brought an exponential increase in the demand of the radio spectrum. However, according to the Federal Communications Commission (FCC), almost all the radio spectrum for wireless com- munications has already been allocated. In addition, according to FCC, up to 85% of the allocated spectrum is underutilized due to the current fixed spectrum alloca- tion policy. To alleviate the spectrum scarcity problem, FCC has suggested a new paradigm for dynamically accessing the allocated spectrum. Cognitive radio (CR) technology has emerged as a promising solution to realize dynamic spectrum access (DSA). With the capability of sensing the frequency bands in a time and location- varying spectrum environment and adjusting the operating parameters based on the sensing outcome, CR technology allows an unlicensed user to exploit the licensed channels which are not used by licensed users in an opportunistic manner. In this dissertation, distributed intelligent spectrum management in CR ad hoc networks is explored. In particular, four spectrum management issues in CR ad hoc networks are investigated: 1) distributed broadcasting in CR ad hoc networks; 2) distributed optimal HELLO message exchange in CR ad hoc networks; 3) distributed protocol to defend a particular network security attack in CR ad hoc networks; and 4) distributed spectrum handoff protocol in CR ad hoc networks. The research in this dissertation has fundamental impact on CR ad hoc network establishment, net- work functionality, network security, and network performance. In addition, many of the unique challenges of distributed intelligent spectrum management in CR ad hoc networks are addressed for the first time in this dissertation. These challenges are extremely difficult to solve due to the dynamic spectrum environment and they have significant effects on network functionality and performance. This dissertation is essential for establishing a CR ad hoc network and realizing networking protocols for seamless communications in CR ad hoc networks. Furthermore, this dissertation provides critical theoretical insights for future designs in CR ad hoc networks

Role of Deep Learning in Mobile Ad-hoc Networks

The portable capability of MANETs has specially delighted in an unexpected expansion. A massive need for dynamic ad-hoc basis networking continues to be created by advancements in hardware design, high-speed growth in the wireless network communications infrastructure, and increased user requirements for node mobility and regional delivery processes. There are several challenging issues in mobile ad-hoc networks, such as machine learning method cannot analyze features like node mobility, channel variation, channel interference because of the absence of deep neural layers. Due to decentralized nature of mobile ad hoc networks, its necessitate to concentrate over some extremely serious issues like stability, scalability, routing based problems such as network congestion, optimal path selection, etc. and security

On promoting ad-hoc collaboration among messengers

The explosion growth in the market place for handheld wireless devices has enabled new opportunities for wireless applications. Currently, handheld devices are restricted to being clients that make requests to servers and receive responses over the network. But as mobile ad-hoc networks become the trend, such devices will need to become active participants that serve requests from other devices and convey data to other devices as well. In this paper we present our vision of the future role that handheld devices will play in a mobile ad-hoc network configuration. We present this vision as part of the MESSENGER project that develops data management mechanisms for UDDI registries of Web services using mobile users and their software agents, and then describe its extension for exchanging descriptions of Web services during ad-hoc collaboration sessions. User agents are in charge of interacting with peer users over an ad-hoc network, and collaborating on feeding UDDI registries with recent content. © 2006 IEEE

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673