Figure 21 - uploaded by Jie Gao
Content may be subject to copyright.
Source publication
Many algorithms for routing in sensor networks exploit greedy forwarding strategies to get packets to their destinations. In this paper we study a fundamental difficulty such strategies face: the "local minimum phenomena" that can cause packets to get stuck. We give a definition of stuck nodes where packets may get stuck in greedy multi-hop forward...
Similar publications
We are concerned with charging electric vehicles at home. The energy demand from electric vehicles can increase more rapidly than our ability to increase the generating capacity or the distribution facilities in the electric network. Our objective is to use a smart power distribution algorithm to reduce the inconvenience to electric vehicle owners....
The homology groups provide useful information about a space. In several applications, including sensor networks, a combinatorial space is built to reflect the data and their relations about a specific topic to be analyzed. Hence the computation of the homology groups is of prime interest. However, the combinatorial space may vary and the computati...
Fifth generation and beyond (5G+) systems will support novel cases, and hence, require new network architecture. In this work, network flying platforms (NFPs) as aerial hubs are considered in future 5G+ networks to provide fronthaul connectivity to small cells (SCs). We aim to find the optimal association between the NFPs and SCs to maximize the to...
Programmable Matter (PM) has been widely investigated in recent years. It refers to some kind of matter with the ability to change its physical properties (e.g., shape or color) in a programmable way. One reference model is certainly Amoebot, with its recent canonical version (DISC 2021). Along this line, with the aim of simplification and to bette...
Distributed consensus optimization has received considerable attention in recent years; several distributed consensus-based algorithms have been proposed for (nonsmooth) convex and (smooth) nonconvex objective functions. However, the behavior of these distributed algorithms on {\it nonconvex, nonsmooth and stochastic} objective functions is not und...
Citations
Extending network lifetime is one of the most critical issues in handling wireless sensor networks. The network lifetime is contributed by three factors: routing path length, control packet overhead and load balance among the nodes. In the literature, many routing protocols have been proposed. However, none of them jointly considers all of these factors, thus they can not solve the network lifetime maximization problem thoroughly. In this paper, we aim at designing a routing protocol whose objective is to minimize the routing path length and the control overhead, while maximizing the load balance. The experiment results show that our proposed protocol strongly outperforms state-of-the-art protocols concerning many metrics including network lifetime, routing path stretch, load balance and control overhead.
