security in wireless ad hoc networks

... SECURITY FOR WIRELESS AD HOC NETWORKS Farooq Anjum and Petros Mouchtaris SECURITY FOR WIRELESS AD HOC NETWORKS SECURITY FOR WIRELESS AD HOC NETWORKS Farooq Anjum and ... of security in wireless ad hoc networks To our knowledge, this book is the first book that focuses exclusively on the topic of security for wireless ad hoc networks The topic of security in wireless ... topic of xi xii PREFACE securing network protocols in wireless ad hoc networks Note that networking in ad hoc networks is concerned with enabling two devices with wireless interfaces to communicate...

Ngày tải lên: 25/03/2014, 12:07

... proposals for improving the performance of TCP on wireless ad hoc networks, those readers who are interested in single-hop wireless networks are referred to [17] The readers interested in the surveys ... routing in ad hoc wireless networks Mobile Comput, 153–181 (1996) 25 D Kim, Y Choi, TCP-BuS: improving TCP performance in wireless ad hoc networks, in Communications, 2000 ICC 2000 2000 IEEE International ... protocol, is facing challenges in wireless ad hoc networks From the literature review reported in this article, it is clear that TCP faces the following challenges in wireless ad hoc networks: •...

Ngày tải lên: 21/06/2014, 00:20

... Cheng, J Sun, M Min, and D.-Z Du, “Energy-efficient broadcast and multicast routing in ad hoc wireless networks, ” in Proceedings of the 22nd IEEE International Performance, Computing and Communications ... by the shaded sector in Figure 5(a) There is no any other link included in the tree in the following grow operation Step In the second iteration, the link (4, 1) is found and added into the tree ... Gupta, “On maximizing lifetime of multicast trees in wireless ad hoc networks, ” in Proceedings of the International Conference on Parallel Processing (ICPP ’03), pp 333–340, Taiwan, China, October...

Ngày tải lên: 22/06/2014, 22:20

... 5th ACM MobiHoc – Tokyo, May 24, 2004 Tutorial outline  Introduction – – –  Stationary networks – – –  Motivation: the need for Topology Control (TC) in ad hoc networks An ad hoc network model ... Istituto di Inform atica e Telem atica 5th ACM MobiHoc – Tokyo, May 24, 2004 Motivations for topology control  Both energy and capacity are limited resources in ad hoc networks  In case of Wireless ... Control (TC) — maintain a topology with certain properties (e.g., connectivity) while reducing energy consumption and/or increasing network capacity Istituto di Inform atica e Telem atica Introduction:...

Ngày tải lên: 14/08/2014, 14:20

... maintain a routing table for each power level, and set as the common transmit power the minimum level such that the corresponding routing table contains all the nodes in the network  Setting ... dense networks  However, similar results have been proved also for the case of sparse networks In this case, R=[0,l ]2, and connectivity is investigated for l → ∞  In case of sparse networks, ... di Inform atica e Telem atica the CTR: 3/12 5th ACM MobiHoc – Tokyo, May 24, 2004 CTR: probabilistic approaches  In many realistic scenarios, node positions are not known in advance (for instance,...

Ngày tải lên: 14/08/2014, 14:20

... the minimum-power path in G’ and in G  In words, the power stretch factor is a measure of the increase in the energy cost due to the fact that we communicate using the routing graph G’ instead ... routing messages between nodes in an energy-efficient way  Why use the routing graph G’ instead of G? – Because G’ is sparse, thus the task of finding routes between nodes is much easier than in ... unidirectional links may occur  The RA problem: Consider a set of n points in a d-dimensional region R, denoting the node positions Determine a connecting range assignment RA of minimum energy...

Ngày tải lên: 14/08/2014, 14:20

... transmitting a message along an energy-efficient path in G’)  Other research focused on trying to adjust the maximum nodes’ transmitting range, in such a way that the communication graph remains ... information), the more energy savings can be achieved  However, information quality (and, thus, the energy savings) must be carefully traded off with the cost incurred for making the information available ... unicast, the concept of broadcast stretch factor of a subgraph G’ of G can be defined  Also in this case, the goal is to find sparse broadcast spanners that can be computed in a distributed and localized...

Ngày tải lên: 14/08/2014, 14:20

... mobility model in the ad hoc networks community Every node chooses uniformly at random a destination in [0,1]2, and moves towards it along a straight line with velocity chosen at random in [vmin,vmax] ... (similar to KNeigh): – – – at the beginning, every node orders its neighbors (set of nodes in the maximum transmitting range) according to some criterion (e.g., link quality) then, every node transmits ... Istituto di Inform atica e Telem atica TC protocols: 12/12 5th ACM MobiHoc – Tokyo, May 24, 2004 Mobile networks  Which is the impact of mobility on TC? – Increased message overhead: contrary...

Ngày tải lên: 14/08/2014, 14:20

... Open issue Istituto di Inform atica e Telem atica Mobility: 10/10 5th ACM MobiHoc – Tokyo, May 24, 2004 Open issues  Considerable body of research devoted to TC in ad hoc networks, but several ... idealized model of a real wireless network  Main limitation of this model: assumption that the radio coverage area is a perfect circle  In realistic scenarios: radio coverage area influenced by many ... influenced by many factors (obstacles, buildings, existing infrastructure, weather conditions, etc.), and it is hardly regular  Including too many details in the network model would make it extremely...

Ngày tải lên: 14/08/2014, 14:20

... Preliminary step in this direction: the determination of the information exchange period for the LMST protocol [Li et al.03b] Istituto di Inform atica e Telem atica Open issues: 7/11 5th ACM MobiHoc ... Istituto di Inform atica e Telem atica Open issues: 8/11 5th ACM MobiHoc – Tokyo, May 24, 2004 TC in the protocol stack  Where should TC be positioned in the protocol stack?  No clear answer in the ... Our view: Routing Layer TC Layer MAC Layer Istituto di Inform atica e Telem atica Open issues: 9/11 5th ACM MobiHoc – Tokyo, May 24, 2004 TC and Routing One possible view: Routing Protocol Trigger...

Ngày tải lên: 14/08/2014, 14:20

... 7/16 5th ACM MobiHoc – Tokyo, May 24, 2004 Infinite loop  If not implemented carefully, the optimization described in the previous slide can lead to packets getting into infinite loops! n1 S ... found in which CLUSTERPOW is more efficient than NTCPL, or in which the contrary holds  Intuitively, NTC-PL is more efficient in the uplink (from u to n1), while CLUSTERPOW is more efficient in ... “Topology Control in Wireless Ad Hoc and Sensor Networks , Tech Rep IIT-TR-04/2003, Istituto di Informatica e Telematica, Pisa Italy, March 2003 Available upon request Istituto di Inform atica e Telem...

Ngày tải lên: 14/08/2014, 14:20

... proposed and applied to existing localization algorithms In the paper “A new time-based algorithm for positioning mobile terminals in wireless networks by I Martin-Escalona and F Barcelo-Arroyo, ... nodes is investigated The last two papers address the problem of localizing and tracking objects using a WSN In particular, the paper “Localization capability of cooperative anti-intruder radar systems” ... running This study addresses the accuracy of the TOAD algorithm in two different environments: line-of-sight (LOS) and non-line-of-sight (NLOS) This technique improves the scalability and integrity...

Ngày tải lên: 22/06/2014, 01:20

... proportional fair scheduling with minimum rate constraints in clustered multihop TD/CDMA wireless ad hoc networks, ” in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC ... connectivity in CDMA wireless ad hoc networks as follows Definition Given the spreading gain, modulation and coding scheme, and the desired throughput, a link between two nodes exists when the corresponding ... published in IEEE WCNC 2006 [1] A Muqattash and M Krunz, “CDMA-based MAC protocol for wireless ad hoc networks, ” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking &...

Ngày tải lên: 22/06/2014, 19:20

... and the main challenges that face the ad hoc/ sensor network designer 1.2.1 Ad hoc networks Wireless ad hoc networks have attracted the attention of researchers in academia and industry in the last ... fixed infrastructure This is a very distinguishing feature of ad hoc networks with respect to more traditional wireless networks, such as cellular networks and wireless LAN, in which nodes (for instance, ... I Introduction Ad Hoc and Sensor Networks 1.1 The Future of Wireless Communication 1.1.1 Ad hoc networks 1.1.2 Wireless sensor networks 1.2 Challenges 1.2.1 Ad hoc networks...

Ngày tải lên: 27/06/2014, 00:20

... I Introduction Ad Hoc and Sensor Networks 1.1 The Future of Wireless Communication 1.1.1 Ad hoc networks 1.1.2 Wireless sensor networks 1.2 Challenges 1.2.1 Ad hoc networks ... appears in print may not be available in electronic books Library of Congress Cataloging -in- Publication Data Santi, Paolo Topology control in wireless ad hoc and sensor networks / Paolo Santi p cm Includes ... Topology Control in Wireless Ad Hoc and Sensor Networks Topology Control in Wireless Ad Hoc and Sensor Networks Paolo Santi Istituto di Informatica e Telematica del CNR – Italy...

Ngày tải lên: 14/08/2014, 14:20

... and the main challenges that face the ad hoc/ sensor network designer 1.2.1 Ad hoc networks Wireless ad hoc networks have attracted the attention of researchers in academia and industry in the last ... model of ad hoc network Since sensor networks are a subclass of ad hoc networks, this model applies to this type of networks also 2.1 The Wireless Channel Nodes in ad hoc and sensor networks ... environments Unfortunately, ad hoc and sensor networks are likely to be used in very different situations, such as indoor or urban scenarios (ad hoc networks) , or under MODELING AD HOC NETWORKS 19 Figure...

Ngày tải lên: 14/08/2014, 14:20

... regulating the access to the wireless, shared channel Medium access control is of fundamental importance in ad hoc/ sensor networks in order to reduce conflicts as much as possible, thus maintaining ... the routing and MAC layer (see Figure 3.5) 3.4.1 Topology control and routing The routing layer is responsible for finding and maintaining the routes between source/ destination pairs in the network: ... application in mobile ad hoc networks 3.4 Topology Control in the Protocol Stack A final question is left: where should topology control mechanisms be placed in the ad hoc network protocol stack? Since...

Ngày tải lên: 14/08/2014, 14:20

... that shadowing/fading effects are not considered, transmitting range, and transmit power level are equivalent concepts Since traditionally the function RA is defined in terms of range, instead of ... shortest path destination tree, the corresponding spanning tree T is obtained by changing the directed edges in the shortest path tree to the corresponding undirected edges in G Since each of the ... orthogonal drawing of G – Add two new vertices for each bend of the drawing so to obtain a straight-line drawing D(G) – Replace each straight-line (edge) in D(G) with a suitable set of nodes (gadget)...

Ngày tải lên: 14/08/2014, 14:20

... determine which one of them is closer This can be accomplished by comparing the transmit powers included in the incoming messages received from v and w (we recall that this information is included ... neighbors within the maximum transmitting range and to build an order on this neighbor set (based, for instance, on distance or on link quality) In a certain sense, this is the minimum amount of information ... ∈ Ek In other words, the symmetric supergraph of Gk is obtained by adding the reverse edge to all the unidirectional links in Gk , while the symmetric subgraph of Gk is obtained by removing all...

Ngày tải lên: 14/08/2014, 14:20

... that in LMST the constructed topology, which in general can contain unidirectional links, is made symmetric by probing each node in N LMST (u), and by removing the link (or adding the reverse link) ... node mobility may occur in ad hoc networks, ranging from highly mobile networks (e.g vehicular ad hoc networks, where node velocity can be above 100 km/h), to networks in which node mobility is ... provide little or stale information about neighbors to LINT, resulting in possibly incorrect power settings As a consequence, this technique is indicated only for ad hoc networks in which nodes regularly...

Ngày tải lên: 14/08/2014, 14:20