The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Applying network coding and opportunistic routing can significantly improve the throughput performance of wireless multi-hop networks, but a mismatch problem still exists among the upper flow rate, routing and lower transmission resource scheduling. This paper models the throughput optimization as a network utility function maximization in wireless multi-hop networks. By applying Lagrangian dual decomposition...
The instability of wireless links makes the choice of forwarding nodes have too many possibilities in opportunistic routing. In this paper, the Markov decision process (MDP) is used to model the whole packet forwarding process from the source node to the destination node, which facilitates making reasonable decisions when the sender selects the forwarding nodes. By solving a finite-state MDP problem,...
The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multi-hop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem...
The individual applications of network coded opportunistic routing and successive interference cancellation have been proven with significant improvement on throughput performance of wireless multi-hop networks, but there lacks practical optimization on their combination application. Based on a TDMA system, this paper models the throughput maximization as network utility function maximization problem...
Mobile Crowd Sensing Networks (MCSN) treat the ordinary users with their mobile devices as the basic sensing units, and leverage them to distribute complex social sensing tasks and collect sensing data with each other by the mobile networks. To improve the efficiency and the feasibility of data sensing, collection and transmission in MCSN, we propose an opportunistic data transmission mechanism based...
Over the past decade, online social networks (OSNs) such as Twitter and Facebook have thrived and experienced rapid growth to over 1 billion users. A major evolution would be to leverage the characteristics of OSNs to evaluate the effectiveness of the many routing schemes developed by the research community in real-world scenarios. In this demonstration, we showcase the Secure Opportunistic Schemes...
Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless networks. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it has been said that...
This paper addresses the issue of reliable data delivery in highly dynamic Mobile Ad-hoc Networks (MANETs). Most existing MANET routing protocols are susceptible to data delivery in reliable and timely manner. To counter this problem, Position-based Greedy Forwarding protocol (PGF), a novel GR protocol which takes advantage of greedy forwarding and opportunistic routing is proposed. In PGF, the best...
In this paper, we propose, design and experiment an energy efficient protocol for Wireless Sensor Networks (WSNs) named Opportunistic Duty cYcle based routing protocol for wirelesS Sensor nEtworks (ODYSSE). The main key innovation of ODYSSE is that it judiciously makes use of three mechanisms. The first one is duty cycling which consists in randomly switching on/off transceivers to save energy. The...
In ad hoc networks, backoff-based OR (opportunistic routing) protocols, which autonomously selects a forwarder among the potential forwarders based on a random backoff time, have been proposed. However, each potential forwarder must wait for the backoff time to avoid packet collisions among receivers. In addition, the terminal density strongly affects the performance since the backoff-based OR protocols...
Underwater wireless sensor networks have received increased attention in recent years due to its numerous applications in oil spills detection, ocean exploration, submarine detection and disaster avoidance. All these applications make use of a number of sensor nodes deployed in different depths in the ocean for data collection and communication. Efficient communication in the network of sensor nodes...
Opportunistic Routing is a new routing paradigm in wireless ad-hoc networks. In this paradigm, the packets are routed with no fixed and predetermined next hop in the network. Broadcast nature of wireless medium is used in opportunistic routing and the next hop will be selected of the receivers of a packet. A problem that has still remained in opportunistic routing is congestion occurrence along the...
Nowadays, almost all telecommunication devices use TCP/IP to communicate with each other. However, it is difficult for MANET to support the type of end-to-end connectivity required by TCP/IP-based communications due to disruptions, frequent topology changes and network partitions caused by the movement of the nodes. DTN is an emerging paradigm in the telecommunication network which is able to provides...
Mobile Opportunistic Network (MON) is a kind of Delay Tolerant Network (DTN) in which nodes are mobile with social characteristics. Users in such network carry data, move and forward it to others for information dissemination. There are already much work done on the routing problem in MON to achieve higher performance, they usually just focus on the physical contact among nodes and their social attributes,...
The current Internet design falls short in scenarios characterized by intermittent connectivity and absence of supporting infrastructure. Pocket switched networking allows communication between portable handheld user devices in such environments through the store-carry-forward paradigm. This involves storing data in device memory, exploiting user movement to physically transport the data, and forwarding...
In the era of mobile computing, understanding human mobility patterns is crucial in order to better design protocols and applications. Many studies focus on different aspects of human mobility such as people's points of interests, routes, traffic, individual mobility patterns, among others. In this work, we propose to look at human mobility through a social perspective, i.e., analyze the impact of...
Prolonging lifetime is an important issue in wireless sensor networks. When the sink is stationary in the network, the nodes close to the sink are bottleneck nodes since they relay more traffic than the other nodes. In this paper, we focus on balancing energy to prolong the networks lifetime. To protect the nodes around the sink, an uneven transmission policy is investigated. Moreover, by considering...
In the existing works, a Kalman filter with recursive covariance estimation (KF-RCE) was proposed by Bo Feng et al. to sequentially estimating process noise covariance matrix. However, there may be a singular matrix existed in the KF-RCE algorithm, which would lead to unreasonable system state estimation in the system initial stage. In this paper, a threshold-based Kalman filter with recursive covariance...
In an Opportunistic Network (Oppnet), the transmission of messages between mobile devices is achieved in a store-carry-and-forward fashion since nodes store the incoming messages in their buffer and wait until a suitable next hop node is encountered that can carry the message closer to the destination. In such environment, due to the delay-tolerant nature of the network, designing a routing protocol...
In this paper, we design a social-relations-based routing algorithm (SRBRA). Firstly, by analyzing the real-time data from mobile nodes in the network, we summarize and extract factors that affect social relations between these mobile nodes. Then make inference and evaluation for the complexity and dynamic of these factors from multiple angles, calculate the social-relations values between each sensor...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.