Search

Your search keyword '"Ad-Hoc Networks"' showing total 1,035 results
Start Over Descriptor "Ad-Hoc Networks"

Refine your results

more »

more »

more »

more »

more »
1,035 results on '"Ad-Hoc Networks"'

103. Topology Properties of Ad-Hoc Networks with Topology Control

Author

Piechowiak, Maciej, Zwierzykowski, Piotr, Junqueira Barbosa, Simone Diniz, editor, Chen, Phoebe, editor, Cuzzocrea, Alfredo, editor, Du, Xiaoyong, editor, Filipe, Joaquim, editor, Kara, Orhun, editor, Kotenko, Igor, editor, Sivalingam, Krishna M., editor, Ślęzak, Dominik, editor, Washio, Takashi, editor, Yang, Xiaokang, editor, Kwiecień, Andrzej, editor, Gaj, Piotr, editor, and Stera, Piotr, editor

Published
2014
Full Text
View/download PDF

105. Self-synchronized Cooperative Beamforming in Ad-Hoc Networks

Author

Janson, Thomas, Schindelhauer, Christian, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Felber, Pascal, editor, and Garg, Vijay, editor

Published
2014
Full Text
View/download PDF

107. Trust Management Method for Vehicular Ad Hoc Networks

Author

Shaikh, Riaz Ahmed, Alzahrani, Ahmed Saeed, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Singh, Karan, editor, and Awasthi, Amit K., editor

Published
2013
Full Text
View/download PDF

109. Cross-Layered OFDMA-Based MAC and Routing Protocol for Multihop Adhoc Networks

Author

Quang, Khanh, Nguyen, Van Duc, Nguyen, Trung Dung, Choo, Hyunseung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Murgante, Beniamino, editor, Misra, Sanjay, editor, Carlini, Maurizio, editor, Torre, Carmelo M., editor, Nguyen, Hong-Quang, editor, Taniar, David, editor, Apduhan, Bernady O., editor, and Gervasi, Osvaldo, editor

Published
2013
Full Text
View/download PDF

110. Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem

Author

Joseph, Shaun N., DiPippo, Lisa C., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bar-Noy, Amotz, editor, and Halldórsson, Magnús M., editor

Published
2013
Full Text
View/download PDF

111. Adaptive Network Coding based on Node Mobility for Broadcasting in Mobile Ad-hoc Networks

Author

Masami Yoshida, Alberto Gallegos Ramonet, and Taku Noguchi

Subjects
flooding, General Engineering, network coding, broadcast, Ad-hoc networks
Abstract

Mobile ad-hoc networks (MANETs) have limited network resources such as node battery capacity and wireless frequency bands. Therefore, to ensure efficient broadcast communication in such networks, it is critical to reduce unnecessary packet transfers and maximize the use of network resources and power. Network coding (NC) is a technique for reducing the number of transmitted packets over a network and maximizing the use of devices and network resources. The packet-reduction benefits obtained using NC depend considerably on network topology. In this study, we propose an NC method particularly designed for MANETs. In our approach, the nodes switch the type of transmission between an uncoded transmission (simple broadcast) and a coded transmission (NC) based on the estimated neighboring node’s proximity. The effectiveness of the proposed method was evaluated using computer simulations. Our evaluations demonstrated that the proposed method can reduce the number of packets in the network without decreasing the packet delivery rate.

Published
2022
Full Text
View/download PDF

113. Distributed Context Space (DCS) - Foundation of Semantic P2P Systems

Author

Schwotzer, Thomas, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Liñán Reyes, Matías, editor, Flores Arias, José M., editor, González de la Rosa, Juan J., editor, Langer, Josef, editor, Bellido Outeiriño, Francisco J., editor, and Moreno-Munñoz, Antonio, editor

Published
2012
Full Text
View/download PDF

114. An ETX Based Positioning System for Wireless Ad-Hoc Networks

Author

Hossain, A. K. M. Mahtab, Mekbungwan, Preechai, Kanchanasut, Kanchana, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Sénac, Patrick, editor, Ott, Max, editor, and Seneviratne, Aruna, editor

Published
2012
Full Text
View/download PDF

115. RNBB: A Reliable Hybrid Broadcasting Algorithm for Ad-Hoc Networks

Author

Yousef, Ausama, Rishe, Samer, Mitschele-Thiel, Andreas, Awad, Abdalkarim, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Koucheryavy, Yevgeni, editor, Mamatas, Lefteris, editor, Matta, Ibrahim, editor, and Tsaoussidis, Vassilis, editor

Published
2012
Full Text
View/download PDF

116. CoRMAC: A Connected Random Topology Formation with Maximal Area Coverage in Wireless Ad-hoc Networks

Author

Mustafa Tosun, Umut Can Cabuk, Elif Haytaoglu, Orhan Dagdeviren, and Yusuf Ozturk

Subjects
Ad hoc networks, Computer Networks and Communications, Wireless communications, connected coverage, Wireless communication, Wireless ad-hoc networks, Geometry, random geometric graph, Energy conservation, Sensor nodes, Area coverages, connected random topology, Topology, Area coverage, Random topology, Flow graphs, Network topology, Scalability, Lattice, Lattices, Network security, Wireless sensor networks, Ad-hoc networks, Computer Science Applications, Hardware and Architecture, Signal Processing, Random geometric graphs, Information Systems, Data flow analysis
Abstract

R1C2Random geometric graphs can be used in constructing topology formations for wireless ad-hoc networks (WANETs), including wireless sensor networks, flying ad-hoc networks, and others. They are useful for energy-saving schemes where a randomly alternating subset of deployed nodes is turned off temporarily (without compromising the network connectivity). This also improves network security by periodically re-routing the data flow, which makes it harder for third parties to run a traffic analysis. In the area and target coverage scenarios, a WANET deployment is desired to have maximal area coverage efficiency, which implies covering the largest possible area using the fewest number of nodes by maintaining the connectivity as well. Although deterministic topology formations offering optimal area coverage are known, a random node deployment method that grants connectivity and area coverage maximality has not been presented, to the best of our knowledge. This study introduces a novel topology formation method, called CoRMAC, that consistently yields tree-formed random geometric graphs that are guaranteed to be connected and offer maximal area coverage for any given area size and node cardinality. The area coverage maximality of CoRMAC is formally proven. Extensive theoretical and computational analyses have been provided to demonstrate its graph-theoretic, Euclidean, and networking features. Moreover, comparisons were made with other approaches to show the effectiveness of the proposed method. IEEE

Published
2023
Full Text
View/download PDF

119. CLAP: Cross-Layer Protocols for Phealth

Author

Angelidis, Pantelis, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Lin, James C., editor, and Nikita, Konstantina S., editor

Published
2011
Full Text
View/download PDF

120. An Efficient Routing Protocol for Ad-Hoc Networks

Author

Kumar, Chiranjeev, Tyagi, Neeraj, Tripathi, Rajeev, Prasanth Kumar, M. Lakshmi, Sharma, Dhirendra Kumar, Biswash, Sanjay Kumar, Abraham, Ajith, editor, Lloret Mauri, Jaime, editor, Buford, John F., editor, Suzuki, Junichi, editor, and Thampi, Sabu M., editor

Published
2011
Full Text
View/download PDF

125. Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network

Author

Johnen, Colette, Mekhaldi, Fouzi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Jeannot, Emmanuel, editor, Namyst, Raymond, editor, and Roman, Jean, editor

Published
2011
Full Text
View/download PDF

126. Reducing Energy Consumption in Manet Using A Layer Three Routing Protocol

Author

Alexandru Robert SIMION

Subjects
ad-hoc networks, Engineering (General). Civil engineering (General), TA1-2040
Abstract

Mobile ad-hoc network (MANET) is an autonomous system based on wireless links in which information is exchanged without having any centralized administration. In this paper, one of its main challenge, the limited battery power is treated. Based on the network layer information an energy reduction algorithm was proposed and the influence of reduced energy consumption over other metrics was studied. The paper pays a special attention to the effects of the hidden terminal problem in mobile wireless network.

Published
2015

127. A Vehicle-to-Vehicle Communication Protocol for Collaborative Identification of Urban Traffic Conditions

Author

Risan, Øyvind, Peytchev, Evtim, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Zheng, Jun, editor, Simplot-Ryl, David, editor, and Leung, Victor C. M., editor

Published
2010
Full Text
View/download PDF

128. Cooperative Spectrum Sensing in Ad-Hoc Networks (Invited Paper)

Author

Gavrilovska, Liljana, Atanasovski, Vladimir, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Zheng, Jun, editor, Simplot-Ryl, David, editor, and Leung, Victor C. M., editor

Published
2010
Full Text
View/download PDF

129. Distributed Channel Selection for Ad-Hoc Networks in the Presence of Jamming Sources

Author

Barrera, Jorge, Garcia, Alfredo, Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Coulson, Geoffrey, Series editor, Zheng, Jun, editor, Mao, Shiwen, editor, Midkiff, Scott F., editor, and Zhu, Hua, editor

Published
2010
Full Text
View/download PDF

132. Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths

Author

Larsson, Andreas, Tsigas, Philippas, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Lu, Chenyang, editor, Masuzawa, Toshimitsu, editor, and Mosbah, Mohamed, editor

Published
2010
Full Text
View/download PDF

133. A Study on the Topology Control Method for Bluetooth Scatternet Formation

Author

Yu, Chih-Min, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Pan, Jeng-Shyang, editor, Chen, Shyi-Ming, editor, and Nguyen, Ngoc Thanh, editor

Published
2010
Full Text
View/download PDF

134. VirtualConnection: Opportunistic Networking for Web on Demand

Author

Yusuf, Lateef, Ramachandran, Umakishore, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kant, Krishna, editor, Pemmaraju, Sriram V., editor, Sivalingam, Krishna M., editor, and Wu, Jie, editor

Published
2010
Full Text
View/download PDF

135. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.

Author

Abu-Khzam, Faisal N., Markarian, Christine, Heide, Friedhelm Meyer auf der, and Schubert, Michael

Subjects
*HEURISTIC algorithms, *APPROXIMATION theory, *AD hoc computer networks, *ALGORITHMS, *PROBLEM solving
Abstract

We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using directed disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. Due to the dynamic nature of ad-hoc networks, distributed algorithms for this problem are of practical significance. Hence, we seek algorithms that do not require centralized computation and yet yield good approximation factors and/or behave well in practice. We present a first distributed approximation algorithm for this problem. The algorithm achieves a constant approximation ratio if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded and takes O(Diam) rounds, where Diam is the diameter of the graph. Moreover, we present a simple distributed heuristic algorithm and conduct an extensive simulation study showing that our heuristic outperforms previously known approaches for the problem. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

136. Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing.

Author

Maccari, Leonardo and Lo Cigno, Renato

Subjects
TECHNOLOGY convergence, ROUTING (Computer network management), CENTRALITY
Abstract

One of the key features of a routing protocol is its ability to recover from link or node failures, recomputing routes efficiently without creating temporary loops. Indeed, in real conditions, there is always a trade-off between the overhead due to the periodic generation of control messages and route convergence time. This paper formalizes the problem of the choice of timers for control message generation as an optimization problem that minimizes the route convergence time, constrained to a constant signaling overhead. The solution requires the knowledge of nodes’ centrality in the topology and can be obtained with a computational complexity low enough to allow on-line computation of the timers. Results on both synthetic and real topologies show a significant decrease of the transient duration with the consequent performance gain in terms of reduced number of unreachable destinations and routing loops. Our proposal is general and it can be applied to enhance any link-state routing protocol, albeit it is more suited for wireless networks. As a concrete example, we present the extension of OLSRv2 with our proposal, named Pop-Routing, and discuss its performance and the stability of centrality metrics in three large-scale real wireless mesh networks. This exhaustive analysis on traces of the topology evolution of real networks for one entire week shows that pop-routing outperforms the non-enhanced protocol in every situation, even when it runs with sub-optimal timers due to centrality computation on stale information. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

137. EVALUATION OF DYNAMIC AD-HOC UWB INDOOR POSITIONING SYSTEM.

Author

Sakr, Mostafa, Masiero, Andrea, and El-Sheimy, Naser

Subjects
ULTRA-wideband devices, INDOOR positioning systems, RANGE measurements
Abstract

Ultra-wideband (UWB) technology has witnessed tremendous development and advancement in the past few years. Currently available UWB transceivers can provide high-precision time-of-flight measurements which corresponds to range measurements with theoretical accuracy of few centimetres. Position estimation using range measurement is determined by measuring the ranges from a rover or a dynamic node, to a set of anchor points with known positions. However, building a flexible and accurate indoor positioning system requires more than just accurate range measurements. The performance of indoor positioning system is affected by the number and the configuration of the anchor points used, along with the accuracy of the anchor positions. This paper introduces LocSpeck, a dynamic ad-hoc positioning system based on the DW1000 UWB transceiver from Decawave. LocSpeck is composed of a set of identical nodes communicating on a common RF channel, forming a fully or partially connected network where the positioning algorithm run on each node. Each LocSpeck node could act as an anchor or a rover, and the role could change dynamically during the same session. The number of nodes in the network could change dynamically, since the firmware of LocSpeck supports adding and removing nodes on-the-fly. The paper compares the performance of the LocSpeck system with commercially available off-the-shelf UWB positioning system. Different operating scenarios are considered when evaluating the performance of the system, including cases where collaboration between the two systems is considered. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

138. Caching hit probability and Compressive Sensing perspective for mobile cellular networks.

Author

Xifilidis, Theofanis and Psannis, Kostas E.

Subjects
*COMPRESSED sensing, *WIRELESS sensor networks, *5G networks, *DISTRIBUTION (Probability theory), *CELL phones
Abstract

Ever since the advent of wireless communications, there has been a tremendous growth in data traffic and service demand. Both of the above quantities are expected to explosively dominate wireless communication networks, as we move on to the future 5G wireless communication systems. This paper involves the so-called hit probability related to data caching, a technique that mainly alleviates backbone network congestion and reduces latency, by storing frequently accessed data in mobile users' cache (mobility-aware caching) and leaves the least popular data for recovery from base stations. The hit probability is defined in the literature as the probability of specific file request by a user together with the successful delivery of the data packet to the user/network node that made the request. Considering three distributions, the uniform, the well-established Zipf-like distribution and the normal distribution, we allow a varying number of cached filles and observe the curves representing the hit probabilities and perform comparison. We provide interpretation of the related to optimality results i.e. greatest achievable hit probability. In a pico-cell of a cellular network of minimum radius of 50 m and a maximum radius of 200 m, we derive the transmission power level and verify that it complies to the typical transmission power of a pico-cell. A final remark involves the Compressed Sensing sparsity concept, where considering that the possibility that a file is cached with probability p, and not cached with probability 1 −  p , we examine the «sparsest» and «densest» scenario with respect to the number of cached files n opposed to the total N files in the aggregate users' cache, plotting the equivalent total probability. A final conclusion sets the issues of future work. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

139. Fast, scalable and secure over-the-air bootstrap of Linux operating systems with Wi-Fi ad hoc networks.

Author

Zúquete, André and Vieira, José

Subjects
*BOOTSTRAP aggregation (Algorithms), *LINUX operating systems, *WIRELESS Internet, *AD hoc computer networks, *INTERNET servers
Abstract

This article describes and evaluates the performance of DETIboot, a system conceived for securely deploying temporary Linux systems into countless receiving hosts close enough to a Wi-Fi DETIboot server. This system was created with the ultimate goal of installing, in numerous students’ laptops and just-in-time, special Linux distributions for being temporarily used in practical classes. In this document we present an overview of DETIboot, a comprehensive description of the coding used in the broadcast communication and a detailed performance evaluation in a spacious auditorium. This evaluation did not involve security features to reduce the amount of variables influencing the final results. However, previous experiments allow us to extrapolate a maximum of 5% increase in the download time due to security. On average, it took us 50.1 s to download a 225 MiB Slax Linux over 802.11g, taking on average 15% more time than the theoretical lower bound of our setup (43.4 s). The influence of the position of receivers in the auditorium was not prominent. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

140. Grey wolf optimization based clustering algorithm for vehicular ad-hoc networks.

Author

Fahad, Muhammad, Aadil, Farhan, Rehman, Zahoor-ur-, Khan, Salabat, Shah, Peer Azmat, Muhammad, Khan, Lloret, Jaime, Wang, Haoxiang, Lee, Jong Weon, and Mehmood, Irfan

Subjects
*VEHICULAR ad hoc networks, *METAHEURISTIC algorithms, *WOLF behavior, *ANIMAL social behavior, *STRUCTURAL optimization
Abstract

Abstract In vehicular ad-hoc network (VANETs), frequent topology changes occur due to fast moving nature of mobile nodes. This random topology creates instability that leads to scalability issues. To overcome this problem, clustering can be performed. Existing approaches for clustering in VANETs generate large number of cluster-heads which utilize the scarce wireless resources resulting in degraded performance. In this article, grey wolf optimization based clustering algorithm for VANETs is proposed, that replicates the social behaviour and hunting mechanism of grey wolfs for creating efficient clusters. The linearly decreasing factor of grey wolf nature enforces to converge earlier, which provides the optimized number of clusters. The proposed method is compared with well- known meta-heuristics from literature and results show that it provides optimal outcomes that lead to a robust routing protocol for clustering of VANETs, which is appropriate for highways and can accomplish quality communication, confirming reliable delivery of information to each vehicle. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

142. A Secure Spontaneous Ad-Hoc Network to Share Internet Access

Author

Lacuesta, Raquel, Lloret, Jaime, Garcia, Miguel, Peñalver, Lourdes, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Ruiz, Pedro M., editor, and Garcia-Luna-Aceves, Jose Joaquin, editor

Published
2009
Full Text
View/download PDF

143. Topology Control in Large-Scale High Dynamic Mobile Ad-Hoc Networks

Author

El-Habbal, Mohamed, Rückert, Ulrich, Witkowski, Ulf, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Kim, Jong-Hwan, editor, Ge, Shuzhi Sam, editor, Vadakkepat, Prahlad, editor, Jesse, Norbert, editor, Al Manum, Abdullah, editor, Puthusserypady K, Sadasivan, editor, Rückert, Ulrich, editor, Sitte, Joaquin, editor, Witkowski, Ulf, editor, Nakatsu, Ryohei, editor, Braunl, Thomas, editor, Baltes, Jacky, editor, Anderson, John, editor, Wong, Ching-Chang, editor, Verner, Igor, editor, and Ahlgren, David, editor

Published
2009
Full Text
View/download PDF

144. Authentication Scheme Based on Trust and Clustering Using Fuzzy Control in Wireless Ad-Hoc Networks

Author

Park, Seong-Soo, Lee, Jong-Hyouk, Chung, Tai-Myoung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Gervasi, Osvaldo, editor, Taniar, David, editor, Murgante, Beniamino, editor, Laganà, Antonio, editor, Mun, Youngsong, editor, and Gavrilova, Marina L., editor

Published
2009
Full Text
View/download PDF

145. Concept-Based Routing in Ad-Hoc Networks

Author

Schoeneich, Radosław Olgierd, Domaszewicz, Jarosław, Koziuk, Michał, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Garg, Vijay, editor, Wattenhofer, Roger, editor, and Kothapalli, Kishore, editor

Published
2009
Full Text
View/download PDF

149. Field-Based Coordination for Pervasive Computing Applications

Author

Mamei, Marco, Zambonelli, Franco, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Liò, Pietro, editor, Yoneki, Eiko, editor, Crowcroft, Jon, editor, and Verma, Dinesh C., editor

Published
2008
Full Text
View/download PDF

150. Connectivity Gateway Discovery in MANETs

Author

Yuste, Antonio J., Triviño, Alicia, Trujillo, Fco. David, Casilari, Eduardo, Díaz-Estrella, Antonio, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Cerdà-Alabern, Llorenç, editor

Published
2008
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results