A routing protocol suitable for backhaul access in wireless mesh networks

Campista, Miguel Elias M.; Costa, Luís Henrique M. K.; Duarte, Otto Carlos Muniz Bandeira

doi:10.1016/j.comnet.2011.10.016

Cited by 8 publications

(3 citation statements)

References 30 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The transient notion between all these studies is that there are immediate neighborhood structures to use but none of them actually defined a notion of vicinity for DTN. Similar principles have also been considered even in other contexts, such as wireless mesh networks [22].…”

Section: Related Workmentioning

confidence: 98%

Beyond contact predictions in mobile opportunistic networks

Tatar

Phe-Neau

Amorim

et al. 2014

2014 11th Annual Conference on Wireless on-Demand Network Systems and Services (WONS)

View full text Add to dashboard Cite

Abstract-When studying and designing protocols for mobile opportunistic networks, most works consider only direct contact patterns between mobile nodes. Tracking these contacts is important for end-to-end communications but relying only on this kind of information provides a limited view about transmission possibilities. Mobile users are often in intercontact, but still separated by only a few hops, which translate into effective communication opportunities between nodes. In this paper, we focus on such a type of communication opportunities and investigate to what extent they can be predicted. Using realworld datasets, we provide evidences about the predictable nature of nodes' proximity and evaluate the benefits of these results compared to direct contact predictions.

show abstract

Section: Related Workmentioning

confidence: 98%

Beyond contact predictions in mobile opportunistic networks

Tatar

Phe-Neau

Amorim

et al. 2014

2014 11th Annual Conference on Wireless on-Demand Network Systems and Services (WONS)

View full text Add to dashboard Cite

show abstract

“…The author presented a reference routing model that searches for the optimal route in terms of a link metric. To provide backhaul access in WMN, Wireless-mesh-network Proactive Routing (WPR) protocol is proposed by Campista et al (2012). WPR computes routes based on link states and it uses two Algorithms such as controlled flooding and Adapted Multipoint Relay set computation algorithm (AMPR) to improve the overall efficiency of the network.…”

Section: Related Work 21 Routing In Wmnmentioning

confidence: 99%

Discrete multi-objective differential evolution algorithm for routing in wireless mesh network

Murugeswari

Radhakrishnan

2015

Soft Comput

View full text Add to dashboard Cite

The wireless mesh network (WMN) is a challenging technology that offers high quality services to the end users. With growing demand for real-time services in the wireless networks, quality-of-service-based routing offers vital challenges in WMNs. In this paper, a discrete multi-objective differential evolution (DMODE) approach for finding optimal route from a given source to a destination with multiple and competing objectives is proposed. The objective functions are maximization of packet delivery ratio and minimization of delay. For maintaining good diversity, the concepts of weight mapping crossover (WMX)-based recombination and dynamic crowding distances are implemented in the DMODE algorithm. The simulation is carried out in NS-2 and it is observed that DMODE substantially improves the packet delivery ratio and significantly minimizes the delay for various scenarios. The performance of DMODE, DEPT and NSGA-II is compared with respect to multi-objective performance measures namely as 'spread'. The results demonstrate that DMODE generates true and well-distributed Pareto-optimal solutions for the multi-objective routing problem in a single run.

show abstract

“…The Virtual Ring Routing (VRR) [79] is another protocol that uses a flat identification space, but limits the routing scope to a multihop wireless network [80], [81]. VRR reduces the scalability problem because it deals with fewer nodes than it would find in the Internet.…”

Section: ) Other Proposalsmentioning

confidence: 99%

Challenges and Research Directions for the Future Internetworking

Campista

Rubinstein

Moraes

et al. 2014

IEEE Commun. Surv. Tutorials

Self Cite

View full text Add to dashboard Cite

Abstract-We review the main challenges and survey promising techniques for network interconnection in the Internet of the future. To this end, we first discuss the shortcomings of the Internet's current model. Among them, many are consequence of unforeseen demands on the original Internet design such as: mobility, multihoming, multipath, and network scalability. These challenges have attracted significant research efforts in the latest years because of both their relevance and complexity. In this survey, for the sake of completeness, we cover several new protocols for network interconnection spanning both incremental deployments (evolutionary approach) and radical proposals to redesign the Internet from scratch (clean-slate approach). We focus on specific proposals for future internetworking such as: Loc/ID split, flat routing, network mobility, multipath and content-based routing, path programmability, and Internet scalability. Although there is no consensus on the future internetworking approach, requirements such as security, scalability, and incremental deployment are often considered.

show abstract

A routing protocol suitable for backhaul access in wireless mesh networks

Cited by 8 publications

References 30 publications

Beyond contact predictions in mobile opportunistic networks

Beyond contact predictions in mobile opportunistic networks

Discrete multi-objective differential evolution algorithm for routing in wireless mesh network

Challenges and Research Directions for the Future Internetworking

Contact Info

Product

Resources

About