Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a infrastructure-less network with self configuring capability of mobile nodes connected by wireless. Each node moves freely in any direction, and will therefore change its links to other devices frequently. Since mobile hosts move freely, disconnections occur frequently and this causes frequent network division. So, the data sharing in network play a vital role. For effective data sharing, the data replication is needed. Many data replication techniques have been proposed to minimize performance degradation. In most cases it is assumed that all mobile nodes collaborate fully in terms of sharing their memory space. Some nodes decide not to cooperate. Performance of the network and data accessibility is affected by these selfish nodes. The proposed work examines the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. It is termed as selfish replica allocation. The work includes developing a selfish node det...

Recent disasters have not only pointed out to humanity how small we are compared to nature, but also showed us that terrorism has become a factor that we cannot ignore. We are being forced to handle crisis situations in the most efficient way we can. Especially the first hours after a disaster can be of vital interest to the victims and an efficient and well thought approach can greatly reduce the number of victims. After the event of a crisis, rescue workers therefore have to be able to do their work in a dynamic and dangerous environment, with all means available. In these situations it has turned out that on a local and global level, the communication between rescue workers is sometimes a problem. Recently more interest has been going out to assisting rescue workers in their work by offering them solutions to problems or extra tools and services to simplify their tasks while improving the results. The approach described in this thesis work aims at facilitating the communication for the rescue workers and offering them services if needed. This communication is provided by an ad-hoc network of mobile devices, PDAs, that offer services to rescue workers, while at the same time providing an infrastructure for processing of data from the rescue workers. The communication primarily takes place via a blackboard structure, that is distributed over the nodes in the network. Besides offering communication to the actual rescue workers that have the task of helping victims and reporting about the situation, another challenge is to collect all the knowledge that is available, to get to an overview of the situation. For this purpose, we propose introducing a structure in the topology of the network that is most applicable to a crisis situation. Our approach consists of introducing mobile crisis centers, with around them rings of nodes that take care of the processing of the data that comes in from the outer ring, that consists of the sensor nodes. These sensor nodes can be rescue workers with PDAs, but also sensors on robots or fixed sensors (e.g. chemical gas sensors). This approach is inspired by current procedures of crisis teams. The approach aims at providing services in the network, by dynamically assigning tasks to nodes in the network. Besides the place in the network, the (distributed) decision where a tasks is to be executed, is based on performance measures of the nodes. These are integrated in one value, that is used as a decision criteria. Besides assigning tasks to the best node at hand, the system offers more functionalities with respect to fault tolerance, in the form of replication and monitoring of other nodes.

In this paper, a utility-based joint power and rate adaptive algorithm (UPRA) is proposed to alleviate the influence of channel variation by using softened signal-to-interference-andnoise ratio (SINR) requirements. The transmission power and rate of each user will be adjusted to maximize its own net-utility according to the states of channel, which results in a balance between the effective transmission rate and power consumption. Although the UPRA works based on a non-cooperative game, cooperation among users can be achieved so that the throughput of the whole network will be improved. The convergence of the algorithm has also been studied in both feasible and infeasible cases. Index Terms-Joint power and rate adaptive, non-cooperative game, effective transmission rate, wireless ad hoc networks. T RANSMISSION power and rate have significant impacts on the performance of wireless networks. On one hand, high transmission rate requires high Signal-to-Interferenceand-Noise Ratio (SINR). On the other hand, high transmission power means more energy consumption and interference to other users. Although the issue of joint power and rate control is challenging, it offers more flexibility in radio resource management thus the possibility of better network performance. Non-cooperative game model was employed for power control in wireless networks in previous work. One characteristic of non-cooperative games is "all players for themselves" . Each node tries to maximize its own net-utility, which is defined as utility minus cost. With distinct optimizing objectives, different utility functions were formulated in prior work, such as throughput per unit power consumption [2], frame outage [3], Shannon capacity [4] and sigmoid-like softened SINR requirement . The cost was often modeled as a linear function of transmission power. In this way, cooperation was introduced to the non-cooperative game. It should be pointed out that all the above algorithms were designed for cellular networks where power control schemes can be implemented at base stations. However, power control in wireless ad hoc networks can only work based on local measurements. In [6], a joint transmission power and rate control algorithm based on game theory, called Distributed Power and Rate Control based on Step-up Pricing Game (DPRC/SPG), was proposed for wireless ad hoc networks. Its net-utility function is defined as the normalized transmission rate minus the cost of Paper approved by S. A. Jafar, the Editor for Wireless Communication Theory and CDMA of the IEEE Communications Society. Manuscript

We study the estimation of residual link lifetime (RLL) in mobile ad hoc networks (MANETs) using the distances between the link's nodes. We first prove that to compute uniquely the RLL, at least four distance measurements are required. We also demonstrate that random measurement errors are the dominant factor in prediction inaccuracy and that systematic errors are negligible. We then propose a mobile-projected trajectory (MPT) algorithm, which estimates the relative trajectory between two nodes from periodical measurements of the distances between them. Using the relative trajectory, the algorithm estimates the RLL of the link between the two nodes. For comparison purposes, we derive a theoretical upper bound on the achievable prediction inaccuracy by any distance-based RLL prediction algorithm with unknown but finitely bounded measurement-error distribution. To account for velocity changes, the MPT is enhanced with a velocity-change detection (VCD) test. Performance evaluation demonstrates robustness in RLL prediction for piecewise-linear trajectory and multiple velocity changes during the link lifetime.

Energy consumption for data transmission in mobile ad hoc networks can be reduced by decreasing the transmission range ofeach node. However, a transmission range that is too short reduces the node density to the extent that it becomes impossible to maintain a fully connected network. Consequently, each node has to rely on its mobility to first bring itself into the transmission range of another node before propagating the data packets, thereby leading to a longer delay in data delivery. On the other hand, if a network such as the Delay Tolerant Network (DTN) can tolerate this delay to some degree, using a short transmission range will be of great advantage to conserving transmission energy. Epidemic Routing is a protocol proposedfor a DTN that consists of nodes with short transmission ranges. In this paper, we ascertain how Epidemic Routing works and address its drawbacks. Then we propose several schemes using different ways of restricting Epidemic Routing and evaluate the performance of each scheme. In order to evaluate the schemes we use a method of deriving the performance of each scheme and comparing the schemes from the standpoint of the tradeoff between energy consumption and time delay, while maintaining a fixed delivery rate. The efficacy ofthis method is shown through both evaluation and simulation results.

Gossiping, a probabilistic algorithm for networkwide broadcasting, can significantly reduce the number of transmissions in one-to-all message spread. Based on the Continuum Percolation Theory, we develop a novel analytical model of gossiping for wireless ad hoc networks. This model provides an intuitive way for setting the gossiping probability, so that a gossip achieves high degree of network coverage with limited number of transmissions. We also propose and study a distributed gossiping scheme, in which nodes set their gossiping probabilities according to locally acquired information. Both gossiping schemes are demonstrated to be scalable; i.e., for fixed network area, the expected number of gossip transmissions does not depend on the number of nodes in the network. The analytical results are verified via simulations of large ad hoc networks.

A Mobile Ad hoc NETwork (MANET), is a self-configuring infra structure less network of mobile devices connected by wireless links. ad hoc is Latin and means "for this purpose". Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. QOS is defined as a set of service requirements to be met by the network while transporting a packet stream from source to destination. Intrinsic to the notion of QOS is an agreement or a guarantee by the network to provide a set of measurable pre-specified service attributes to the user in terms of delay, jitter, available bandwidth, packet loss, and so on. The analysis is mainly between proactive or table-driven protocols like OLSR (Optimized Link State Routing) viz DSDV (Destination Sequenced Distance Vector) & CGSR (Cluster Head Gateway Switch Routing) and reactive or source initiated routing protocols viz AODV (Ad hoc on Demand distance Vector) & DSR (Dynamic Source Routing). The QoS analysis of the above said protocols is simulated on NS2 and results are shown thereby.

Cybercrime is a global phenomenon and not belonging distinctively to Nigeria. (Akano, 2013) maintained that, cybercrime does not respect geographical boundary, fighting the menace can only be achieved through partnership with other cyber security organizations and institutions across the world. Cyber-crime by definition is any harmful act committed from or against a computer or network, it differs according to McConnell International, “from most terrestrial crimes in four ways: they are easy to learn how to commit, they require few resources relative to the potential damages caused, they can be committed in a jurisdiction without being physically present in it and fourthly, they are often not clearly illegal. Another definition given by the Director of Computer Crime Research Centre (CCRC) during an interview on the 27th April, 2004, is that “cyber-crime („computer crime‟) is any illegal behavior directed by means of electronic operations that targets the security of computer system...

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. A promising technique for addressing this problem is to use multiple redundant paths between the source and the destination. However, while multipath routing algorithms can tolerate network failures well, their failure resilience only holds if the paths are selected judiciously. In particular, the correlation between the failures of the paths in a redundant path set should be as small as possible. However, selecting an optimal path set is an NPcomplete problem. Heuristic solutions proposed in the literature are either too complex to be performed in real-time, or too ineffective, or both. This paper proposes a multipath routing algorithm, called Disjoint Pathset Selection Protocol (DPSP), based on a novel heuristic that, in nearly linear time on average, picks a set of highly reliable paths. The convergence to a highly reliable path set is very fast, and the protocol provides flexibility in path selection and routing algorithm. Furthermore, DPSP is suitable for real-time execution, with nearly no message exchange overhead and with minimal additional storage requirements. This paper presents evidence that multipath routing can mask a substantial number of failures in the network compared to single path routing protocols, and that the selection of paths according to DPSP can be beneficial for mobile ad hoc networks, since it dramatically reduces the rate of route discoveries.

This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and it takes into consideration the central nodes from previous time slots. We study also the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.

In this paper we propose Genetic Algorithm for reducing connected dominating set in Wireless Adhoc networks. Virtual backbone will be formed to count connected dominating set. It shows that the connected dominating size is reduced in our virtual backbone. It solves the problem of flooding. We use concept of Unit Disk Graph from graph theory to solve our example. We finally prove that the Minimum Connected Dominating Set (MCDS) is NP-Complete. Our approach for solving this problem by considering weight for the vertices.

This chapter highlights the importance of vehicular ad-hoc networks (VANETs) in the context of the 5G-enabled smarter cities and roads, a topic that attracts significant interest. In order for VANETs and its associated applications to become a reality, a very promising avenue is to bring together multiple wireless technologies in the architectural design. 5G is envisioned to have a heterogeneous network architecture. Clustering is employed in designing optimal VANET architectures that successfully use different technologies. Therefore, clustering has the potential to play an important role in the 5G-VANETenabled solutions. This chapter presents a survey of clustering approaches in the VANET research area. The survey provides a general classification of the clustering algorithms, presents some of the most advanced and latest algorithms in VANETs, and it is among the fewest works in the literature that reviews the performance assessment of clustering algorithms.

Conocer sobre ciudadanías y audiencias, es entender las segmentaciones estilísticas desde las que ellas opinan, participan o se diferencian de la práctica política en las sociedades mediatizadas. El ecosistema democrático-mediático sabe muy poco acerca de cómo son los jóvenes, los adultos mayores, los pobres, los deportistas aficionados, las diferentes religiones, los pueblos originarios, etc. Los conflictos de administración de los hábitos durante la pandemia mostraron ese nivel de desconocimiento. Sin discutir las políticas específicas, la consigna/orden “¡Quedate en  casa!” emitida por cualquiera que estuviera en un set de televisión o estudio de radio y la falta de contención sobre las consecuencias,  mostraron el poco conocimiento de lo que significa estar quieto en una cultura, que es tanto de la movilidad como de la mediatización.
Si la metodología bien utilizada permite generar nuevos conocimientos aplicables, en primer lugar deberíamos entender cuál es el contexto de uso de conceptos y saberes previos a esta época.

Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at anytime. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." Abstract This document describes the messagesand procedures of the Negative-acknowledgement (NACK) Oriented Reliable Multicast (NORM) protocol. This protocol is designed to provide end-to-end reliable transport of bulk data objects or streams over generic IP multicast routing and forwarding services. NORM uses a selective,negative acknowledgement mechanism for transport reliability and offersadditional protocol mechanisms to allow for operation with minimal "a priori" coordination among sendersand receivers. A c...

The Art and Science of Antenna
Selection: A Practitioner's Guide
4.3. Case Study 3: Drone (UAV) Communication System for Long-Range Visual Line of Sight Inspection
 The Product: A robust communication system for a heavy-lift Unmanned Aerial Vehicle (UAV) designed for long-range, Beyond Visual Line of Sight (BVLOS) inspection of critical linear infrastructure (e.g., power lines, pipelines).
 The Core Challenge: Achieving a low-latency, high-bandwidth, and ultra-reliable command & control (C2) and real-time video downlink at ranges of up to 50 km, while operating in RF-challenging environments like deep valleys, near power lines, and in varying weather conditions. The system must be lightweight, low-power, and aerodynamically neutral.
 The Final Choice: A dual-link system combining a high-gain, dual-antenna automatic tracking system on the ground (for primary C2 and HD video) with an integrated 4G/LTE cellular modem on the drone (for backup C2 and telemetry). This failsafe architecture ensures continuous control and data recovery even if the primary link is interrupted.

The proliferation of Mobile Adhoc Networks (MANETs) help to realize the nomadic computing paradigm with ubiquitous access. Though they ensure self-maintainable, dynamic and temporary topology, the MANETS also suffer from constraints in power, storage and computational resources. In addition, the pervasiveness, ubiquity and the inherent wireless nature, warrant appropriate security provisions in these networks that becomes difficult to support, amidst the lack of sufficient resource strengths. As a result, the MANETs are more vulnerable to various communications security related attacks. In this paper, therefore, we attempt to focus on analyzing and improving the security of one of the popular routing protocol for MANETS viz. the Ad hoc On Demand Distance Vector (AODV) routing protocol. Our focus specifically, is on ensuring the security against the Blackhole Attacks. We propose modifications to the AODV protocol and justify the solution with appropriate implementation and simulation using NS-2.33. Our analysis shows significant improvement in Packet Delivery Ratio (PDR) of AODV in presence of Blackhole attacks, with marginal rise in average end-to-end delay.

A mobile ad hoc network is a collection of nodes that are independent. Nodes in the network communicate to each other directly and indirectly via intermediate node. Mobile ad hoc network has major challenges such as energy consumption because of battery power is limited in mobile ad hoc network. We investigate that, simple flooding of message takes more energy. We propose a K-hop based ERS algorithm, which is appropriate for minimizing the energy consumption by using the concept of expanding ring search algorithm. Keywords-Energy, time, expanding ring search (ERS), K-hop based ERS.

We propose a mesh-based multicast routing protocol for wireless ad hoc networks. The protocol retains all of the advantages of the on-demand multicast routing protocol (ODMRP) such as high packet delivery ratio under high mobility, high throughput. Moreover, the protocol significantly reduces control overhead, one of the main weaknesses of ODMRP, under the presence of multiple sources. This feature is

In next generation wireless network the most desirable feature is its ability to move seamlessly over various access network regardless of the network infrastructure is used. The handover between these dissimilar networks can be explored by using vertical handover algorithms. This paper focuses on the vertical handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms which provide significant improvements in throughput but at a cost of higher delays. As per the need for the real time applications in next generation wireless networks there is a requirement of developing new optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.

In next generation wireless network the most desirable feature is its ability to move seamlessly over various access network regardless of the network infrastructure is used. The handover between these dissimilar networks can be explored by using vertical handover algorithms. This paper focuses on the vertical handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms which provide significant improvements in throughput but at a cost of higher delays. As per the need for the real time applications in next generation wireless networks there is a requirement of developing new optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.

Abstract. MANET security is becoming a challenge for researchers with the time. The lack of infrastructure gives rise to authentication problems in these networks. Most of the TTP and non-TTP based schemes seem to be impractical for being adopted in MANETs. A hybrid key-management scheme addressed these issues effectively by pre-assigned logins on offline basis and issuing certificates on its basis using 4G services. However, the scheme did not taken into account the CRL status of servers; if it is embedded the nodes need to check ...

The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CDS of competitive size with localized information, they either lack the mechanism to properly handle nodal mobility or require lengthy period of time to recover when CDS becomes corrupted. In this paper, a novel protocol, namely Multi-Initiator Connected Dominating Set protocol (MI-CDS), is proposed that constructs and maintains CDS of competitive size efficiently without introducing much communication overhead. The simulation results demonstrate that MI-CDS permits CDS to be available for the highest percentage of time in the mobile network scenario compared with the other CDS protocols.

Research in mobile ad hoc networks is a challenging field due to the constant changes in network topology. Broadcast service is fundamental in such networks, as it supports a wide range of important applications and dy-namic source routing protocols. The traditional broadcast protocol (i.e., flooding) is known to be inefficient due to the broadcast storm problem, which leads to severe message collisions and channel contention. To alleviate this problem, a number of broadcast protocols are proposed that aim at reducing the number of retransmissions for a broadcast. In this paper, we show that by merely using the immediate (i.e., within a single hop) neighbor's locations, a mobile host can compute a small subset of neighbors (known as the minimum cover set) for broadcast retransmissions. Based on the concept of the cover set, we then propose three new location-aided broadcast protocols for mobile ad hoc networks that effectively broadcast the message with a very competitive number of retransmissions. We then go on to compare and analyze the simulation results of our protocols against others. The results show that the new broadcast protocols are capable of achieving high reachability with a low number of retransmissions and, overall, outperform other protocols.

The mass composition and all-particle energy spectrum of cosmic rays are determined by analysis of coincident events between the IceTop air shower array on the surface and the deep IceCube strings. IceTop mainly detects the electromagnetic component of high energy cosmic ray air showers, while the TeV muon bundle penetrates deep into the Antarctic ice and generates Cherenkov light, which is seen by IceCube. This analysis uses data taken from June 2010 to May 2011 when the detector was nearly complete with IceCube in its 79 string conguration and IceTop running 73 stations. Variables sensitive to composition and primary energy are based on the lateral signal distribution reconstructed at the surface by IceTop and the energy loss of the muon bundles reconstructed by IceCube. Using a neural network we determine the average mass A and all-particle flux in the energy range from a few PeV up to 1 EeV. We find that < log A > increases up to at least 100 PeV.

The combined information from cosmic ray air showers that trigger both the surface and underground parts of the IceCube Neutrino Observatory allows the reconstruction of both the energy and mass of the primary particle through the knee region of the energy spectrum and above. The properties of high-energy muon bundles, created early in the formation of extensive air showers and capable of penetrating deep into the ice, are related to the primary energy and composition. New methods for reconstructing the direction and composition-sensitive properties of muon bundles are shown. Based on a likelihood minimization procedure using IceCube signals, and accounting for photon propagation, ice properties, and the energy loss processes of muons in ice, the muon bundle energy loss is reconstructed. The results of the highenergy muon bundle reconstruction in the deep ice and the reconstruction of the lateral distribution of low energy particles in the surface detector can be combined to study primary composition and energy. The performance and composition sensitivity for both simulated and experimental data are discussed.

Mobile ad hoc network is an assembly of mobile nodes that haphazardly forms the temporary network and it is an infrastureless network. Due to its self-motivatedor mobility in nature the nodes are more vulnerable to security threats which stimulate the performance of the network. In this paper, a review on a various types of coordinated attack is deliberated such as blackhole / grayhole attack which are most serious threats in mobile ad hoc network. In cooperative blackhole attack more than one node collude to each other hence this attack is more challenging to identify. This paper presents a review of different security mechanism to eliminate the blackhole / grayhole attack from the network.

Realizing high volume real time communication in a highly dynamic architecture like Mobile Ad hoc Networks (MANET) still remains a major point of research. In this paper, we have attempted to address the issue of maintaining an uninterrupted session between a source and a destination through multiple paths in a temporal domain. We have tried to develop an agent-centric protocol

This paper presents an analytical and simulationbased work which helps to estimate time duration of routes in a mobile ad-hoc network. First, we studied a simple route with a single intermediate node between source and destination, and then we model how long it takes for the intermediate node to leave the route (i.e., leave the overlapping region formed by the intersection of the coverage areas between source and destination). Then, we generalized the model for routes with N intermediate nodes. Simulation experiments were developed using the NS-2 network simulator to verify that our theoretical model agrees with simulation results.

Mobile Ad hoc Networks (MANETs) consist of a large number of relatively low-powered mobile nodes communicating in a network using radio signals. Clustering is one of the techniques used to manage data exchange amongst interacting nodes. Each group of nodes has one or more elected Cluster head(s), where all Cluster heads are interconnected for forming a communication backbone to transmit data. Moreover, Cluster heads should be capable of sustaining communication with limited energy sources for longer period of time. Misbehaving nodes and cluster heads can drain energy rapidly and reduce the total life span of the network. In this context, selection of best cluster heads with trusted information becomes critical for the overall performance. In this paper, we propose Cluster head(s) selection algorithm based on an efficient trust model. This algorithm aims to elect trustworthy stable cluster head(s) that can provide secure communication via cooperative nodes. Simulations were conducted to evaluate trusted Cluster head(s) in terms of clusters stability, longevity and throughput.

We consider Robot-assisted Search&Rescue operations enhanced with some fixed image sensor nodes capable of capturing and sending visual information to a robot sink. In order to increase the performance of image transfer from image sensor nodes to the robot sinks we propose a 2-hop neighborhood information-based cover set selection to determine the most relevant image sensor nodes to activate. Then, in order to be consistent with our proposed approach, a multipath extension of Greedy Perimeter Stateless Routing (called T-GPSR) wherein routing decisions are also based on 2-hop neighborhood information is proposed. Simulation results show that our proposal reduces packet losses, enabling fast packet delivery and higher visual quality of received images at the robot sink.

An ad hoc network is the assortment of cooperative wireless nodes without existence of any access point or infrastructure. The presence of malicious nodes in an ad hoc network deteriorates the network performance. A novel approach for malicious nodes detection is proposed here to protect against DoS attack in ad hoc on-demand distance vector routing protocol. The proposed approach employs a method for determining conditions under which malicious node should be monitored. Apart from identification of malicious node, it has been observed that this approach leads to less conservation and less communication breakage in ad hoc routing. The experimental results demonstrate that the proposed approach can effectively detect malicious nodes Reference

Mobile Ad Hoc Network (MANET) is an infrastructure less network where the nodes doesn't required any fixed infrastructure or base station to transmit data. Nodes are self-organizing and selfconfiguring. The routing protocol is used in such a network to find a proper link through which packets will be transmitting from its source to destination. An ad-hoc network routing protocol aims to meet the challenges of dynamically changing topologies in a network and handle a lot of nodes with limited resources. It is a challenging task to design routing protocols for these types of networks due to their dynamic nature In this research work we have analyzed Dynamic Source Routing protocol with FTP traffic over the network. For simulation we have used NS2 simulator through which we have created network design model and simulate the result. We have evaluated delay, network load, packet delivery ratio (PDR), route discovery time and throughput of the network as performance metrics.

ABSTRACT: A suburban ad-hoc network (SAHN) aims to provide an inexpensive, secure, broadband, cooperative network using wireless technology. There exists a plethora of ad-hoc wireless routing solutions designed to route efficiently in mobile environments. Due to the ...

A suburban ad-hoc network (SAHN) is an economical, high-speed alternative for communities of cooperating users. The SAHN aims to provide broadband suburban area connectivity for local area networks with low costs using wireless technology. There exists a plethora of efficient routing solutions for ad-hoc networks. However, less attention has been paid towards optimizing these protocols for ad-hoc networks with a quasi-static topology 1 . In this paper we outline an efficient routing algorithm, particulary for a suburban ad-hoc network, to make efficient use of network resources. Our primary comparison results are with respect to DSR and AODV.

With the demand for multimedia and computational science applications, guaranteed performance communication services have become a necessary feature of future high-speed networks. These communications services should possess a high level of sophistication so that they can easily adapt the network to the wide variety of applications soon to be seen, thereby allowing the network to increase its availability and flexibility. Availability is the ability of the network to accommodate as many real-time clients as possible without violating any client's performance guarantees, while flexibility is the ability to adapt to changing network state and client demands in order to maintain the performance guarantees and quality of service promised to the client. Flexibility also refers to the ability of the network to easily increase the variety of real-time services that it offers. It is our contention that availability and flexibility can be enhanced in a network by providing the network with the ability to modify the performance parameters and/or the route of any guaranteed performance connection in the network without violating the previously made performance contracts. In this paper, we present a scheme for dynamically managing guaranteed performance service connections and experimental results to verify the correctness and usefulness of the scheme. The motivation for this scheme, Dynamic Connection Management (DCM), is discussed, and detailed descriptions of the DCM modification contracts and algorithms are provided. A survey of guaranteed performance services protocols, architectures, and routing algorithms are presented, together with their relevance to this work. A simulator has been built, and preliminary experiments and analyses were done on the scheme. The paper concludes with a summary and some topics for future work.

Wireless Mesh Networks (WMNs) are part of wireless technologies that are known for their flexibility and extended coverage. Wireless applications have reached their peak in applications related to various fields such as healthcare, image processing, and so on. However, delay and energy efficiency are considered the two aspects that diminish the performance of WMNs. To overcome the aforementioned issues, this research introduces an effective routing method using Multi-Objective Dwarf Mongoose Optimization Algorithm (MO-DMOA). The MO-DMOA performs routing by considering the multiple paths using an enriched population resource. The nomadic behavior of MO-DMOA helps in detecting the optimal routing path with minimized over-exploitation. The proposed MO-DMOA is evaluated with different routing schemes such as Load Balance and Interference Avoid-Partially Overlapped Channels Assignment (LBIA-POCA) framework, and Multi-Objective Dyna Q-based Routing (MODQR). The outcomes obtained through the experimental analysis show that the proposed approach acquires a better throughput of 13.5 × 10 5 kbps for 22 flows, whereas the existing LBIA-POCA achieves a throughput 60× 10 3 kbps.

IPTV merupakan protokol aplikasi TCP/IP yang menggunakan pengalamatan internet (IP Address) dalam suatu jaringan telekomunikasi untuk pengiriman konten multimedia berbentuk audio video, yaitu berupa layanan siaran televisi digital. Dalam perkembangannya, IPTV tidak hanya digunakan untuk mentransmisikan konten siaran televisi dari perusahaan siaran televisi (TV Broadcasting) yang sudah mapan, tetapi juga dapat digunakan untuk mentransmisikan konten siaran televisi lokal pada cakupan terbatas, seperti suatu lingkungan masyarakat, kantor, kampus atau suatu komunitas tertentu. Sebagaimana umumnya siaran televisi dalam mode transmisi simplex, televisi lokal ini bersumber dari suatu komputer server yang menyediakan konten televisi digital yang dapat diakses oleh sejumlah pengguna melalui suatu jaringan lokal dengan cara men-setting IP Address media player pada unit penerima. Unit penerima tersebut dapat berupa PC Portabel (Notebook), tablet atau smartphone, sedangkan media player yang digunakan untuk Local IPTV ini adalah VLC Media Player. Agar dapat memberikan kenyamanan bagi pengguna Local IPTV, perlu adanya jaminan kualitas layanan (Quality of Service = QoS). QoS dalam Local IPTV ini dapat diukur dan dianalisa dari kemampuan jaringan lokal dalam mentransmisikan sinyal audio video dengan baik. Oleh karena itu, penelitian ini akan mengukur dan menganalisa QoS Local IPTV dalam jaringan LAN nirkabel atau jaringan IEEE 802.11. Parameter QoS yang diukur dan dianalisa adalah perbandingan jarak terminal client ke Access Point terhadap kecepatan data (bit rate), lama waktu memulai siaran (initial time), latency dan kualitas gambar. Metodologi yang digunakan adalah membangun jaringan IEEE 802.11 dengan satu komputer sebagai Server Televisi dan dua smartphone, dua notebook dan dua tablet sebagai terminal client; membangun Server Televisi dan men-setting VLC Media Player; menguji coba dan mengambil data pengukuran berupa kecepatan data (bit rate), lama waktu memulai siaran (initial time), latency dan kualitas gambar pada televisi lokal berbasis IP; serta menganalisanya.

In the disaster situation, it is important to collect quickly global information on the disaster area and victims buried in the debris and waiting for rescue. In the DDT project (Special Project for Earthquake Disaster Mitigation in Urban Areas), the research and development on rescue infrastructure for global information collection have been carried out. In the activity of the mission unit for infrastructure, ubiquitous handy terminal devices have been and technology for forming an ad-hoc wireless communication network have been developed as well as technology to integrate the collected information on the GIS system including communication protocol design. In this paper, the current R & D activities of the mission unit for infrastructure in the DDT project are overviewed, and some technologies developed so far are introduced.

In this paper, we propose a novel evolutionary algorithm called Genetic Algorithm with Asexual Reproduction (GAwAR) to solve Maximum Lifetime Coverage (MLC) Problem in Wireless Sensor Networks (WSN). We use for GAwAR a binary coding of the problem, develop asexual operator of crossover and operator of mutation in which knowledge about MLC problem is incorporated, and apply deterministic selection. We compare the proposed algorithm with a standard Genetic Algorithm with elitist strategy. We show that the proposed GAwAR significantly outperforms the standard Genetic Algorithm.

In a Delay Tolerant Network (DTN), the nodes have intermittent connectivity and complete path(s) between the source and destination may not exist. The communication takes place opportunistically when any two nodes enter the effective range. One of the major challenges in DTNs is message forwarding when a sender must select a best neighbor that has the highest probability of forwarding the message to the actual destination. However, finding an appropriate route remains an NP-hard problem. This paper presents a concept of Checkpoint (CP) based message forwarding in DTNs. The CPs are autonomous high-end wireless devices with large buffer storage and are responsible for temporarily storing the messages to be forwarded. The CPs are deployed at various places within the city parameter that are covered by bus routes and where human meeting frequencies are higher. For the simulative analysis a synthetic human mobility model in ONE simulator is constructed for the city of Fargo, ND, USA. The model is tested over various DTN routing protocols and the results indicate that using CP overlay over the existing DTN architecture significantly decreases message delivery time as well as buffer usage.

In a Delay Tolerant Network (DTN), the nodes have intermittent connectivity and complete path(s) between the source and destination may not exist. The communication takes place opportunistically when any two nodes enter the effective range. One of the major challenges in DTNs is message forwarding when a sender must select a best neighbor that has the highest probability of forwarding the message to the actual destination. However, finding an appropriate route remains an NP-hard problem. This paper presents a concept of Checkpoint (CP) based message forwarding in DTNs. The CPs are autonomous high-end wireless devices with large buffer storage and are responsible for temporarily storing the messages to be forwarded. The CPs are deployed at various places within the city parameter that are covered by bus routes and where human meeting frequencies are higher. For the simulative analysis a synthetic human mobility model in ONE simulator is constructed for the city of Fargo, ND, USA. The model is tested over various DTN routing protocols and the results indicate that using CP overlay over the existing DTN architecture significantly decreases message delivery time as well as buffer usage.

Now a day's Heterogeneous wireless network is a promising field of research interest. Various challenges exist in this hybrid combination like load balancing, resource management and so on. In this paper we introduce a reliable load balancing architecture for heterogeneous wireless communications to ensure certain level of quality of service. To conquer the problem of centralized and distributed design, a semidistributed load balancing architecture for multiple access networks is introduced. In this grid based design multiple Load and Mobile Agent Management Units is incorporated. To prove the compactness of the design, integrated reliability, signalling overhead and total processing time is calculated. And finally simulation result shows that overall system performance is improved by enhancing reliability, reducing signalling overhead and processing time.

Detection of malevolent nodes is required to be studied in detail because wireless network work on dynamic topology, many types of problems arise in the network. Each node transmits the message from one node to another node and transfers the source to the build between the nodes. A MANET is a group of multi-hop wireless ad networks. Each node communicates in a radio communication range and adhoc network is a collection of wireless networks. MANET has applied in various types of military, disaster prone areas. MANET is weak due to various attacks due to its open medium. Destination in wireless network. This network is not perfectly safe and secure. Each device in MANET is free to move independently in any direction. Since the nodes are free to move, any node can connect or discard the network at any time.