Search

Copyright of CISTI (Iberian Conference on Information Systems & Technologies / Conferência Ibérica de Sistemas e Tecnologias de Informação) Proceedings is the property of Conferencia Iberica de Sistemas Tecnologia de Informacao and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Reported in this paper are the results of a simulated experimental comparison of Genetic Algorithm (GA) and Ant Colony Optimization (ACO) meta-heuristics, with regards to their suitability and performance in addressing the problem of energy consumption minimization in ad-hoc wireless networks. An energy function model based on Geographic Adaptive Fidelity (GAF) topology management scheme is used in setting the simulation experiment. Results show that GA and ACO meta-heuristics are suitable optimization techniques for energy consumption minimization in ad-hoc wireless networks, with GA giving the least energy consumption in comparison to ACO. [ABSTRACT FROM AUTHOR]

We argue that scalability in ad-hoc networks can be achieved by re-defining the functionality for the information transport system itself, where the functionality is driven by a new type of communication paradigm inherent in information dissemination applications. In particular, among the entire population of generated messages, each user desires only that the personally “most interesting” messages are delivered to them — we call this “star-to-one” communication. In the paper we consider a “Zipf product form” model for message preferences, and propose some decentralized algorithms for message forwarding based on this model. We discuss some simulation results for these algorithms, which suggest that it is possible for the users to efficiently obtain the messages that are of most interest to them. Essentially, the amount of “work” required of each user, on the average, is proportional to the desired number of messages to be received by each user, and is independent of the number of users and the number of messages in the network. [ABSTRACT FROM PUBLISHER]

Ad-hoc wireless networks have gained much popularity due to their easy deployment and dynamic reconfiguration. Ad-hoc networks, as any other network need to support both real time traffic and normal data traffic. Multimedia applications demand stringent guarantees on bandwidth, delay and jitter. In a best effort network, all users obtain the same level of service which depends on the network load. In other words, it cannot support the sophisticated requirements of multimedia applications. Therefore, new mechanisms have to be developed to support the desired QoS(Quality of Service) levels for the modern applications. QoS provision at the medium access level is particularly important because it has direct effect on how and when data is transmitted. A lot of works have been reported that try to render the desired QoS to the application. Some of them are based on dividing traffic into various traffic classes and assigning different back off related values for each class. Some others are based on transmitting multiple frames at a time to reduce the number of contention attempts and some others discard frames with expired deadlines. But many of these dictate strict procedures for assuring the desired QoS of the application. The proposed method is a simpler one based on the application of token rings to wireless domain. It uses election algorithm to find who should transmit data next. Unlike token ring, the proposed system uses a distributed procedure for maintaining the logical structure of the ring. Experiments show that, with the proposed system, the response time of stations that need to send real time data is reduced. [ABSTRACT FROM PUBLISHER]

In this paper, a new MAC and Network cross layer protocol for OFDMA-based Multi-hop Ad-hoc Networks is proposed. In wireless network, when a route is established, the radio resource allocation problems at MAC layer may decrease the end to end performance proportionally with the length of each route. The contention at MAC layer may causes routing protocol to respond by finding new routes and routing table updates. The cross layer protocol allows layers to exchange state information in order to solve the problem and obtain higher performance. The proposed MAC and Network optimized cross layer protocol based the dynamic Sub-channel Assignment Algorithm in [4] to ensure the performance of ad-hoc and multi-hop networks is significantly improved. [ABSTRACT FROM PUBLISHER]

This article presents the concept of building an adaptive ad-hoc network supporting network-centric operations. In the article a guidance for building an adaptive ad-hoc network and how to implement the additional mechanisms necessary for its proper functioning is provided. Additionally, possible applications of these networks are presented. [ABSTRACT FROM PUBLISHER]

The rapid deployment of millions of mobile sensors and smartphones has resulted in a demand for opportunistic encounter-based networking to support mobile social networking applications and proximity-based gaming. However, the success of these emerging networks is limited by the lack of effective and energy efficient neighbor discovery protocols. While probabilistic approaches perform well for the average case, they exhibit long tails resulting in high upper bounds on neighbor discovery time. Recent deterministic protocols, which allow nodes to wake up at specific timeslots according to a particular pattern, improve on the worst case bound, but do so by sacrificing average case performance. In response to these limitations, we have designed Searchlight, a highly effective asynchronous discovery protocol that is built on three basic ideas. First, it leverages the constant offset between periodic awake slots to design a simple probingbased approach to ensure discovery. Second, it allows awake slots to cover larger sections of time, which ultimately reduces total awake time drastically. Finally, Searchlight has the option to employ probabilistic techniques with its deterministic approach that can considerably improve its performance in the average case when all nodes have the same duty cycle. We validate Searchlight through analysis and realworld experiments on smartphones that show considerable improvement (up to 50%) in worst-case discovery latency over existing approaches in almost all cases, irrespective of duty cycle symmetry. [ABSTRACT FROM AUTHOR]

In this article are presented the results of Ad-hoc networks mechanisms analyzes (identification, authorization, autoconfiguration and data exchange). These mechanisms were analyzed taking into account specifications of Ad-hoc networks using in netcentric operations. After that, have been selected the most appropriate mechanisms specified to be used in the special conditions. The Ad-hoc networks mechanisms specifications will be helpful in designing and building of networks for netcentric operations. [ABSTRACT FROM PUBLISHER]

The paper elaborates on a routing protocol that efficiently coordinates data flows among public safety secondary systems considering the unpredictable availability of TVWS spectrum resources. The proposed application scenario exploits for the communication of the nodes both Ad-hoc and mesh network architectures. Ad-hoc network connections are ideally for emergency situations, when the spectrum resources are pour, while the mesh network architecture addresses the emerging market requirements for building wireless networks that are highly scalable and cost effective, offering a solution for the easy deployment of high-speed ubiquitous wireless access. Efficient protocol operation as a matter of maximum-possible routing paths establishments and minimum delays is obtained by a coordination mechanism. The validity of the research approach is verified via a number of experimental tests, conducted under controlled simulation conditions, evaluating the performance of the proposed routing protocol. [ABSTRACT FROM PUBLISHER]

Mobile ad-hoc networks (MANETs) are characterize by time-varying nature of the links and network topology. There are transmission impediments like fading, path loss, blockage and interference that add to the inclined behavior of wireless channels. In such an environment, the network must accommodate the changes, providing end-end packet delivery while at the same time incurring low control overhead. This paper proposes an improvement over the existing routing algorithm for MANETs with the primary goal of maximize connectivity while limiting operating cost by finding those routes which can stay intact for a period of time. [ABSTRACT FROM PUBLISHER]

Ad-Hoc networks have become increasingly popular and they can provide mobile users with ubiquitous communication capability and information access regardless of locations. Presently, there are many research works and applications of Ad-Hoc networks. However, in order to achieve the ubiquitous services new platforms and methods are needed. In this paper, we propose the Real Object-Oriented Communication (ROOC) method and implement a middleware for Ad-Hoc networks based on ROOC and P2P concepts. The proposed middleware can provide the ubiquitous services and the applications for Ad-Hoc networks can be developed efficiently. We evaluate the proposed platform by some evaluation results and we show its effectiveness. [ABSTRACT FROM PUBLISHER]

The paper proposes a routing protocol that efficiently coordinates data flows among secondary systems with heterogeneous spectrum availability in an ad-hoc cognitive radio network architecture. Efficient protocol operation as a matter of maximum-possible routing paths establishments and minimum delays is obtained by a coordination mechanism, which was implemented based on a simulation scenario. The simulation scenario includes a number of secondary systems that exploit television white spaces, under the spectrum of commons regime. The validity of the research approach is verified via a number of experimental tests, conducted under controlled simulation conditions, evaluating the performance of the proposed routing protocol. [ABSTRACT FROM PUBLISHER]

This paper presents an innovative architecture for the instrumentation layer of a pervasive large-scale information system. State of the art examples already include an instrumentation layer in a grid infrastructure; nontheless these systems were not designed for large-scale ad-hoc networks, rapidly deployed, continuously upgraded, and dynamically reconfigured when the system is on-line. The main contribution is that of designing an instrumentation layer coherent with existing infrastructures capable of being federated with others, and already providing robust virtualization services in what concerns user authentication and access, distributed storage, and computing power. The large-scale instrumentation layer is inspired by the Internet of Things, and will consist of a large number of autonomous nodes organized in Wireless Sensor Networks and accessing the Internet following the 6LoWPAN specifications. An early implementation of this architecture is proven to respond to use cases centered on data- and event-driven services; it also permits a large degree of flexibility and adaptiveness in end nodes applications. [ABSTRACT FROM PUBLISHER]

Specific to the frequent congestion problems for Ad-Hoc Networks, using the idea of cross-layer design, combined with the principle of node cooperation, integrating the directed graph theory in the local route selection, presents a mechanism of pseudo directed path graph to solve the congestion problems in Ad-Hoc Networks. Selecting the best local cooperative node by adding trust level in the cooperative nodes, achieves the purpose of rapidly completing the partial path reconstruction. Through simulation experiments, the protection of congested nodes in Ad-Hoc Networks, by pseudo directed path graph, can alleviate the load pressure of the congestion node effectively, improve the network's end-to-end throughput greatly, thereby, enhance the service quality for the entire network. [ABSTRACT FROM PUBLISHER]

The paper discusses spectrum aware routing in an ad-hoc cognitive radio network architecture that exploits television white spaces, under the spectrum of commons regime. Vital part of this network architecture is a novel routing protocol that coordinates data flows and establishes optimum routing paths among secondary users with heterogeneous spectrum availability. Efficient protocol operation as a matter of maximum-possible routing paths establishments and minimum delays is obtained by a coordination mechanism that was implemented based on a simulation scenario. The validity of the proposed approach is verified via a number of experiments, under controlled simulation conditions and the performance of the proposed protocol is evaluated considering delay metrics. [ABSTRACT FROM PUBLISHER]

Routing path restitution approach to control and tolerate the congestion in routing models for mobile ad hoc networks is proposed in this paper. Packet loss in network routing is primarily due to link failure and congestion. The majority of present congestion control solutions do not possess the ability to distinguish between packet loss due to link failure and packet loss due to congestion. Here in this paper we propose route discovery and congestion handling algorithms. The proposed cross layer model includes network, MAC and transport layers. In the proposed model the MAC and network layers are having active role in congestion detection and regularization, in contrast the network and transport layers are active in congestion endurance. The experimental and simulation results show that a better congestion control and endurance is possible for this protocol. [ABSTRACT FROM PUBLISHER]

In this paper, a dynamic Sub-channel Assignment Algorithm (DSA) based on orthogonal frequency division multiple access (OFDMA) technology operating in time division duplexing (TDD) and a new routing protocol are proposed. The proposed dynamic Sub-channel Assignment Algorithm solves several drawbacks of existing radio resource allocation techniques in OFDM system used in ad-hoc and multi-hop networks, such as the hidden and exposed node problem, mobility, co-channels interference in frequency (CCI). The proposed routing protocol is jointed with the MAC protocol based the algorithm to ensure the mobility and multi-hop, thus the quality of service in ad-hoc and multi-hop networks is significantly improved. [ABSTRACT FROM PUBLISHER]

According to our studies, the current contention resolution algorithm adapted in wireless ad-hoc networks, binary exponential backoff scheme, does not function well in multi-hop environments due to its several performance issues and technical limitations. For example, unfair channel access, intensive collision, and throughput degradation are several widely known issues. Besides, BEB cannot support multimedia traffic since it does not include any priority mechanism. In this paper, we put forth a simple, fair channel access, priority provision, and well performed contention resolution algorithm for multi-hop wireless ad-hoc networks. Simulations are conducted to evaluate the performance scheme. As it turns out, the results show that the proposed algorithm can effectively alleviate the fairness problem and support multimedia traffic in multi-hop wireless ad-hoc networks. [ABSTRACT FROM PUBLISHER]

DAFMAC is an opportunistic cooperative diversity protocol designed to improve the performance of Ad-Hoc networks. Monte Carlo analysis has shown promising results for significantly improved reliability. This paper presents initial experimental results from an implementation of DAFMAC on commodity hardware. Performance in a simple experimental scenario is shown to be comparable to simulation results. [ABSTRACT FROM PUBLISHER]

Intelligent transportation systems based on 802.11 standards family have a remarkable potential to improve safety and efficiency of road traffic. Owing to high mobility of vehicles, stability of routing in vehicular ad-hoc networks (VANETs) is a challenging issue, especially in case of multi-hop communications. Example techniques available in the literature to increase reliability of routing include e.g., the concept of multipath end-to-end transmission. However, they are not capable of providing continuity of transmission in the presence of failures of all alternate paths occurring in a short period of time. [ABSTRACT FROM PUBLISHER]

Advancements in wireless technology, has led to the increased use of wireless handheld mobile devices. The proliferation of a vast number of these devices and the curiosity of the young generation about the information available on the internet anytime anywhere has resulted in a ubiquitous computing scenario. Ubiquitous computing consists of various kinds of computational devices, networks, collaborating software and hardware entities that are required to be interoperable and discoverable in order to communicate with each other. Interoperability is the ability of two or more systems or components to exchange information and to use the information that has been exchanged. In a highly dynamic and distributed environment like MANets, the basic issue is the discoverability of devices and services by the other entities in the system. This paper presents a framework that supports the discoverability and interoperability of the devices forming an ad-hoc network for ubiquitous applications. The proposed approach uses the Mobile Process (Agents) Group to allow devices on the network to interact with one another. It uses group communication semantics to discover devices and interoperate with those devices. The approach does not impose any constraints at device development time instead uses only run-time constraints. [ABSTRACT FROM PUBLISHER]

The use of directional antennas in ad-hoc networks has advantages such as high spatial reuse and extended antenna range. However it suffers from the deafness problem, which may significantly degrade the network performance. Recently, several directional MAC protocols have been proposed to manage directional antennas effectively and improve the network performance. However, the existing schemes do not adequately address the issues, because they do not consider the multi-rate environment and the overhead to establish communication with the adjacent devices. This paper presents a directional cooperative MAC scheme, in which data is delivered to a destination via a relay node equipped with a directional antenna. Simulation results show that the network performance is improved by using the proposed scheme. [ABSTRACT FROM PUBLISHER]

This paper addresses the minimum transmission broadcast problem in resilient ad-hoc networks and presents efficient solutions, including centralized heuristic algorithms and a distributed algorithm. In disaster-resilient networks, wireless links are unreliable due to harsh environments. Distinct from related work in the literature which typically assumes wireless links are reliable, we address the issue of broadcasting over both reliable wireless links and unreliable wireless links. Our main contributions are as follows: First, we develop heuristic algorithms for both reliable- and unreliable-link model. Second, we propose a distributed algorithm based on 1-hop neighbor information. Using simulation, we confirm that the proposed heuristic algorithms can reduces the number of transmissions significantly and the proposed distributed algorithm performs comparably well to the centralized heuristic algorithms in terms of both delivery ratio and the number of transmissions. [ABSTRACT FROM PUBLISHER]

As Ad-hoc network is a highly dynamic topology of mobile network infrastructure, so the overall routing efficiency of Ad-hoc network is a important issue. By investigating the effects of nodes distribution and broadcasting range of the route request (RREQ) control packets on the routing path establishment, in this paper, we explore the energy efficiency of AODV (Ad-hoc on-demand distance vector) routing algorithms in Ad-Hoc networks. Simulation results show that with the range adaptation to the number of nodes the highest successful rate of routing path establishment is obtained. With the adaptive broadcasting range the routing efficiency can be improved. Thus, the demand transmitting energy of RREQ control packets to establish a routing path can be reduced. [ABSTRACT FROM PUBLISHER]

Host-based mobile ad hoc communication requires the transmission of periodic hello beacons to identify neighbors. Drawing conclusions from received beacons, e.g., containing information about existence and neighbor nodes, to available or demanded content is not possible and the gathered information may be outdated quickly due to dynamic environment changes. Therefore, content-centric networking results in more flexible communication without the need of neighbor information. Instead, information about available content is required. In this paper, we will investigate two different content discovery strategies and discuss their efficiency for mobile communication. The algorithms have been implemented in the CCNx framework and evaluated in VirtualMesh, a hybrid emulation tool for wireless mobile ad hoc networks. [ABSTRACT FROM PUBLISHER]

There are several researches have been conducted and different methods have been applied to extend the features of indoor location tracking using wireless devices. Fingerprint algorithm is one of the popular methods that have been used to track mobile nodes in indoor structure. This paper focuses on the enrichment of positioning accuracy of the Fingerprint algorithm. RSSI mechanism has been used on the Fingerprint Algorithm to encompass better performance for the accurate positioning. The paper has been proposed two different types of Fingerprint methods and their performance variants on different circumstances of indoor environment. The proposed Fingerprint Database mapping has been divided according to the RSSI data redundancy. The proposed Fingerprint methods has been successfully implemented and experimented on UTMMIMOS CoE lab. The experimented results of two Fingerprint methods has been analyzed and compared as well. [ABSTRACT FROM PUBLISHER]

Data sensed and transferred between sensor nodes should be secure and preserve battery life. Some algorithms, such as LEACH (Low Energy Adaptive Clustering Hierarchy), have been proposed to efficiently organize sensor nodes into clusters, where a cluster-head, is elected to represent that cluster. To save energy, the cluster-head coordinates the cluster and forwards data generated within the cluster. Despite preserving energy, in practice LEACH lacks security features. A Secure Cluster Head Election algorithm (SEC-CH-E) that improves the original LEACH algorithm by adding security features as well as bringing increasing energy savings is proposed. The algorithm takes into account wireless sensor networks constraints such as the limited radio range and power limitations when electing secure cluster-head nodes, which are factors unaccounted for in LEACH. It is shown that these factors have profound energy implications. The superiority of Sec-CH-E performance is assessed by looking at the energy remaining in the network and the fraction of dead nodes. [ABSTRACT FROM PUBLISHER]

Cognitive radio (CR) technology enables the opportunistic use of the vacant licensed frequency bands, thereby improving the spectrum utilization. Therefore, considering end-to-end throughput in CR ad-hoc networks is an important research issue because the availability of local spectrum resources may change frequently with the time and locations. In this paper, we propose a cooperative routing protocol in CR ad-hoc networks. An on-demand routing protocol is used to find an end-to-end minimum cost path between a pair of source and destination. The simulation results show that our proposed cooperative routing protocol not only obtains higher end-to-end throughput, but also reduces the end-to-end delay and the amount of control messages compared to previous work. [ABSTRACT FROM PUBLISHER]

Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of “The Weakest Link” TV game. Each node has a utility function whose value depends on its cooperation in forwarding packets on a route as well as the cooperation of all the nodes that form this same route. The more these nodes cooperate the higher is their utility value. This would establish a cooperative spirit within the nodes of the networks. All the nodes will then more or less equally participate to the forwarding tasks which would then eventually guarantee a more efficient packets forwarding from sources to respective destinations. Simulations are run and the results show that the proposed framework efficiently enforces nodes to cooperate and outperforms two other self-learning repeated game frameworks which we are interested in. [ABSTRACT FROM PUBLISHER]

AODV is one of the most widely studied routing protocols for the networks, which have high topology variance. It can quickly build and repair the route from source to destination to recover the broken connection. In this paper, we propose a fast and seamless route repairing (FSRR) algorithm to improve the route recreation procedure in AODV. To seamlessly repairing the route, the FSRR monitors the links on the route and triggers the repairing procedure before the links break off. The major difference between AODV and FSRR is that both source and destination broadcast the RREQ packet simultaneously to repair the route. This bi-direction broadcasting mechanism can reduce the route repairing time. In addition, we also design the redundant RREQ blocking mechanism to moderate the route overhead. Simulation results show that the FSRR cannot only save route repairing time in AODV more than 20% but also decreases about 10%∼20% nodes, which participate in broadcasting the RREQ packets by retaining the same route length as the AODV. [ABSTRACT FROM PUBLISHER]

Self organizing mobile Ad-Hoc networks have gained much attention in the last decade particularly due to their ease of deployment in war zones and natural disasters. Because of the fact that the Ad-Hoc network is a virtual network created by the participating nodes, this approach can be applied to remote areas with no fixed networking capability, and is ideal for coordination in remote locations. Considering the sophistication of equipment capable of handling MIMO techniques and inbuilt GPS receivers, a simple two-stage method of forwarding the message is proposed in this paper. A low frequency broadcast containing GPS coordinates of the nodes is used for node discovery which is then followed by a directional narrow beam at higher frequency for data transfer. The knowledge of GPS location combined with directional transmission is expected to increase the performance of the network. The intent of the paper is to propose a simplified location-based Ad-Hoc routing mechanism and to examine its performance when combined with MIMO space time coding technique. The space time codes are evaluated over a Flat Slow Fading channel using various modulation schemes. The basic premise of the proposed scheme is simplicity and robustness. [ABSTRACT FROM PUBLISHER]

MPR selection is one of the most important and critical functions of OLSR. The OLSR standard specifies an algorithm that has good local properties in terms of number of MPR selected but does not use available information in order to reduce the global number of MPR nodes. MPR selection affects many network properties, from the actual logical topology, to the routing efficiency, to the protocol overhead and the broadcast/multicast delivery. This paper proposes and evaluates two simple modifications to the MPR selection strategy, which are oriented to global properties rather than local ‘optimality’. The results presented show that even marginal modifications of the heuristic lead to a performance improvement, with, for instance, a reduction of up to 15% in the number of control messages required to maintain the topology, a relevant gain specially when obtained without introducing any overhead in control messages. [ABSTRACT FROM PUBLISHER]

The broadcasting protocols for transmission from peer to peer ad-hoc networks are currently a topic of enormous interest. There are several traditional algorithms which deal with the transmission of information from one source to another in the wireless ad-hoc networks. However, these conventional algorithms are not capable of eliminating the data redundancy completely. This study proposes a new technique of merging the traditional algorithms to absolutely eradicate the data redundancy problem in such networks. The customary algorithms such as the counter, distance and location based schemes only provide with a generalized methods of transmitting and reboradcasting information from one node to another but do not address the redundancy problem. The proposed method integrates the counter and location based schemes with the distance based method respectively and compares their performances to get rid of the unnecessary re-transmission of information . [ABSTRACT FROM PUBLISHER]

We introduce TAROT (Trajectory-Assisted ROuTing), a DTN routing framework that detects and extracts structure in node movement in real-time. TAROT is motivated by the postulate that mobility, in particular human mobility such as vehicles, is seldom random and thus exhibits recognizable patterns. TAROT's mobility pattern extraction capabilities transcends current solutions that rely on abbreviated (in some cases, instantaneous) snapshots of mobility history. TAROT is therefore able to predict future mobility with increased accuracy. Routing decisions are guided by node mobility patterns, ultimately resulting in more efficient routing and forwarding of messages. Our approach is capable of accommodating conditions where the best node may be one that is currently moving away from the destination. In its current implementation, TAROT uses a "controlled epidemic" approach to route messages in which nodes will only be "infected" with a message if their mobility pattern takes them closer to the destination. We evaluate TAROT's performance through simulations using the QualNet network simulator. A side-by-side comparison against Epidemic Routing under a variety of mobility and workload scenarios show that TAROT is able to match Epidemic's high data delivery guarantees at substantially reduced overhead (over 60% in some of our experiments). TAROT's efficiency comes at the price of a slight increase in delivery delay (around 20% in our experiments). We argue that applications that use intermittently-connected networked environments are inherently tolerant of delay, and therefore favor slight increases in delay for increased efficiency and reduced resource consumption. [ABSTRACT FROM AUTHOR]

Next generation networks are commonly associated with open service creation environments such as OSA, Parlay or JAIN. These environments make the capabilities provided by telecommunication networks accessible to third party application developers in a distributed way. Although the service capability descriptions currently proposed are appropriate for modelling static network elements some limitations are encountered when trying to use them in ad hoc networks. In this paper we propose a general service model for open service creation in ad hoc pervasive environments. The model proposed decomposes the service capabilities into a layered architecture that is well suited for dynamic service discovery and customization. [ABSTRACT FROM AUTHOR]

Recently, a few applications appeared that emulate the behaviour of a wireless ad-hoc network at the application layer, or make it accessible through a full programming framework on the Android platform. We show in this demo how to enable mesh networking at the network level, in a transparent manner to applications. We use this network to relay information regarding physiological monitoring of a team of fire-fighters in a fire scenario. The application developed in Android receives the information from a wearable sensor and transmits it to a controller that visualizes the current team progress. [ABSTRACT FROM AUTHOR]

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes. [ABSTRACT FROM AUTHOR]