routing in mobile opportunistic networks

... UNIVERSITY OF TECHNOLOGY AND ENGINEERING Binh Minh Nguyen EFFICIENT CORE SELECTION FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS GRADUATION THESIS Faculty of Information Technology Supervisor: ... participating, the network topology, link state, Which are not available or too expensive to acquire in mobile ad hoc networks There are many proposed protocol for multicast routing in mobile ad hoc networks, ... few subnets, routing protocols dense rule will remain spread over the entire flow of inter-network, wasting bandwidth and resources In these cases, sparse style routing, - 14 - PIM-SM instance can...

Ngày tải lên: 23/11/2012, 15:03

... Survivable Routing in WDM Networks The failure in optical communication networks such as accidental fiber link disruption or switching device disorder will affect a huge amount of bandwidth in transmission, ... divided into path protection and link protection In the former, a working path and a link-disjoint protection path are pre-computed for each connection In the later, each link of the working path ... lightpath 1.1 Routing and Wavelength Assignment Given a set of connection requests, the problem of setting up lightpaths by routing and assigning a wavelength to each connection is called routing and...

Ngày tải lên: 28/03/2014, 13:20

... modeling, networking architecture, and routing problems in opportunistic networking Chapter 1, Routing in Mobile Opportunistic Networks, is by Libo Song and David F Kotz, and discusses routing in ... away in April 2010 © 2011 by Taylor & Francis Group, LLC xi Chapter Routing in Mobile Opportunistic Networks Libo Song Google, Inc David F Kotz Dartmouth College Contents 1.1 Routing in Mobile Opportunistic ... suitability to mobile opportunistic networks are discussed Chapter 5, Opportunistic Routing for Load Balancing and Reliable Data Dissemination in Wireless Sensor Networks by Min Chen, Wen Ji,...

Ngày tải lên: 31/05/2014, 00:52

... dynamic making the design of routing protocols in vehicular environments very challenging In this regard, many single-technology routing protocols have been proposed [11–18] These routing protocols ... topology-based routing is used for forwarding packets over more stable links available in long-range networks, and position-based routing scheme is used for forwarding packets over highly variable links in ... loose coupling and tight coupling [7, 24] In loose coupling different access networks are independent and are connected to each other through the Internet However, in tight coupling the networks...

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

... each routing Figure shows the TDP function of hops In this figure, the TDP of Shortest path routing using omni-direction antennas increases rapidly, while the TDP of MinDP routing algorithm increases ... anonymous on demand routing with untraceable routes for mobile ad-hoc networks, ” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc ’03), ... larger than The average TDP of Shortest path routing is 0.953 and the average TDP of MinDP routing algorithm is 0.244 Hence, the MinDP routing algorithm using directional antennas can reduce the total...

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

... Zhang, “Interference-aware topology control and QoS routing in multi-channel wireless mesh networks, ” in Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing ... p in (7), ain p aimq in (10) and (11), and ain p ,mq un p ,mq in (20) are nonlinear Even relaxing the binary constraints of (3) and (14), the problem is still nonconvex So the above programming ... integer linear programming Table lists three methods that will be used in our work In the table, the nonlinear constraint in column can be equivalently replaced by the corresponding linear constraints...

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

... maximum flow problem in lossy networks 3.2 A Game Theoretic Interpretation In this subsection, to gain a more in- depth insight of the internal structure of the obtained multipath routing solution, we ... “On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks an integrated approach using game theoretical and cryptographic techniques,” in Proceedings of the ... number of node-disjoint path between S and T As a limit of node-disjoint multipath routing, the above relationship shows the intrinsic constraint of minimizing r and maximizing a at the same time...

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

... value in its routing table The receiver then forwards the data to that node having the smallest cost C value in its routing table and the same process continues till the data reach to the sink In ... continuous data dissemination in wireless sensor networks, ” in Proceedings of the 1st International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP ’04), Melbourne, ... not consider time deadlines, energy, or congestion at the forwarding nodes while routing a packet to its destination [7] Therefore, no single routing protocol performs well in a complex real-world...

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

... of joining process Routing zone of S Routing zone of A Routing zone of B A Routing zone of S Routing zone of A A B S Routing zone of B B S MRREQ Source node MRREQ Source node MRREP Destination ... proactive unicast routing protocol (the Bellman-Ford routing scheme) to maintain routing information about the cores, in which case considerable overhead may be incurred in a large network Link failures ... Joi Join Request eq nR Joi Jo in Re qu est Forwarder nodes (on the tree) Join Reply Receiver Join Reply Join Reply Join Reply Join Request JoinReq JoinAck Join Reply Receiver Join Request Join Request...

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

... remaining energy levels are given adjacent to the nodes) Thus, the basic idea behind our energy-aware routing protocols is to utilize diverse routing paths instead of continuous use of a single ... having long transmission ranges, with the understanding that more nodes involved in forwarding packets can increase the end-to-end delay In addition, since the MTPR does not consider the remaining ... life routing to support ubiquitous mobile computing in wireless Ad Hoc networks, ” IEEE Commun Mag., vol 39, no 6, pp 138–147, 2001 [5] S Singh, M Woo, and C S Raghavendra, “Power-aware routing in...

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

... partitioning techniques in Kyra effectively partition a pubsub network into multiple smaller routing networks Event routing within each routing network generates significantly lower storage, processing ... system consists of multiple event routing networks, with the following properties: • Filtering-based event routing within each routing network generates low processing and network traffic load • ... subset of networks In this way, events traverse fewer pub-sub servers, reducing processing and network load; also, pub-sub servers only need to maintain a subset of routing information, pertaining...

Ngày tải lên: 23/03/2014, 13:20

... searching for cost-effective and reliable techniques for mobile terminal positioning In this chapter, an overview 33 TEAM LinG 34 Advances in Mobile Radio Access Networks on major mobile terminal ... promising technologies are not of pure academic interest Owing to their compelling advantages, they are being studied by leading mobile network infrastructure vendors and being employed in various ... body networks, personal networks, vehicle networks, local area networks, and wide area networks In principle, these networks can be deployed to provide the infrastructure of ubiquitous networks...

Ngày tải lên: 18/04/2014, 10:43

... GSM devices in domestic or office environments using a very large database of RSS fingerprints Machine learning techniques are employed to extract the location information from online RSS measurements ... unique localizability in cooperative networks with hybrid distance and bearing measurements are determined The author also shows that the localization problem is solvable in linear time, and it ... of Bayesian filtering techniques for indoor positioning by ultrawide band networks The article also highlights the robustness of the cost-reference PF to model inaccuracies Finally, the article...

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

... replace flooding Utilize route cache information, creating reverse path in CREQ forwarding [13] Reactive routing protocols Piggybacking of CREQ & CREP on the routing packets CRLs maintenance and ... of nodes It minimizes routing loads and enhances expandability of network by allowing participating nodes to authenticate each other without being interrupted by joining the cluster In their model, ... bootstrapping, applying a DCA private key, joining a new CH, evicting an existing CH, refreshing CH shares In Bootstrapping operation, to construct the shared key and establish a (k,n) threshold sharing...

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

... importance Using theorem proving techniques, for example, will allow inferring theorems describing the root cause of the incident and steps involved in the attacks Investigating Attacks in Wireless Networks ... and point of access Using a formal model of digital investigation in wireless networks should integrate such mobility-based information when modeling actions in the attack scenario Keeping track, ... provided in the next section Due to the increasing use of wireless communication and network community interest in mobile computing, industry, and academia have granted a special attention to Mobile...

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

... Reinforcement learning using WINTER algorithm in walking scenario: (a) initial prediction window size is set to 0.08 and the future testing window size is set to 0.12; (b) initial prediction window ... of the time windows consists of two operations: expanding, that is, increasing the window size by one time point, and shrinking, that is, decreasing the window size by one time point The collector ... adaptively adjust the time windows by applying the reinforcement learning mechanism from the beginning of the whole procedure Reinforcement learning is a machine learning technique that deals with...

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

... “L-region” In general for IEEE 802.11-based networks the term “link” is misleading Obviously, it is incorrect to consider an imaginary line between two communicating nodes as the link since the ... and Q Yin, “Improving fairness among TCP flows crossing wireless ad hoc and wired networks, ” in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc ... corresponding terms in multihop wireline networks These newly defined terms allowed us to formulate the max-min fairness criterion for wireless ad hoc networks in the space-load domain Finally,...

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

... Also, in order to provide assured QoS, we propose multiple disjoint paths (minimum two) routing as opposed to single path routing Single path routing is not reliable The path may be broken during ... backup path Main contributions The main contributions of this study include the following (1) Joint power control and maximally disjoint multipath routing is proposed using the realistic interference ... Source Routing Protocol for Mobile Ad Hoc Networks (DSR),” Internet Draft, http://ietf.org/internet-drafts/draft-ietf-manet-dsr-10 txt [8] A Srinivas and E Modiano, “Minimum energy disjoint path routing...

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

... Traditional AODV with minimum hop routing for CDMA ad hoc mobile networks using directional antennas (IV) Proposed AODV with energy as routing metric for CDMA ad hoc mobile networks using directional ... AODV with minimum hop routing for CDMA ad hoc mobile networks using omnidirectional antennas (II) Proposed AODV with energy as routing metric for CDMA ad hoc mobile networks using omnidirectional ... outgoing packet according to a preset routing metric Ad hoc on-demand distance vector routing (AODV) is used for ad hoc networks to create routes as they are needed In this paper, AODV routing...

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