A wireless network is a growing technology that allows users to access services and information electronically, irrespective of their geographic locations. Wireless network can be classified in two types: infrastructure network and infrastructure less (ad hoc) network. Mobile ad hoc network is an infrastructure less network without any central coordination point. Mobile ad hoc networks are char...

Last-mile routing refers to the final step in a supply chain, delivering packages from depot station homes of customers. At level single van driver, task is traveling salesman problem. But choice route may be constrained by warehouse sorting operations, van-loading processes, driver preferences, and other considerations rather than straightforward minimization tour length. We propose simple eff...

An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the number of independent routing constraints is more than one. EDFS solves the general k−constrained MCP problem with pseudo-polynomial time complexity O(m · EN + N), where E andN are the number of links and nodes of a grap...

Wireless sensor networks consist of miniaturized battery powered sensor nodes with constrained computational capability. Packet forwarding in sensor networks is usually performed through multi-hop data transmission due to the limitation of the communication range and an optimal choice of the routing path has been significantly increased the performance of the sensor networks. The application of...

The role of a delay-constrained routing protocol is to nd paths between senders and receivers subject to a delay constraint while eÆciently using network resources. Many delay-constrained routing protocols where proposed these last years, most of them give priority to cost minimization during path computing process. This approach builds paths with end-to-end delays too close to the delay constr...

The last decades’ tremendous advances in wireless communications have been driven mainly by personal communications. Radio resource allocation mechanisms for optimizing key metrics, such as average throughput and delay, are by now rather well-developed. However, with the increased interest in wireless machine-to-machine communication, new challenges emerge, such as multi-hop connectivity, lossy...

We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V , a path is X-constrained if all intermediate vertices avoidX. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V , we can route on the shortest X-constrained path between x, y ∈ X. This problem is motivated by Internet routing, where the presence of routin...

This paper presents an approach to power-conserving routing of ad hoc mobile wireless networks. This approach relies on entropy-constrained routing algorithms, which were developed by utilizing the information-theoretic concept of the entropy to gradually reduce the uncertainty associated with route discovery through a deterministic annealing process. Entropy-constrained routing algorithms were...

Hybrid Wireless Mesh Networks are a combination of mobile ad hoc networks and infrastructure wireless mesh networks, consisting of two types of nodes: mobile Mesh Clients and static Mesh Routers. Mesh Routers, which are typically equipped with multiple radios, provide a wireless multi-hop backhaul. The resource constrained Mesh Clients also participate in the routing and forwarding of packets t...