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.
We consider the problem of group secret key generation through a multi-hop network modeled by a pair-wise independent network and propose a low complexity scheme which can guarantee strong secrecy. We assume that the legitimate transmitter only has the knowledge of the maximum number of precoded keys known to any helpers, where the precoded keys are the output of a precoder at the transmitter to be...
The Routing applications are popular in Wireless Sensor Networks (WSNs). For a practical monitoring environment, the monitoring events may be varied, and so do the data sinks. Most of known applications deal with the monitoring without varied data. The varied event and different sinks are regarded as different monitoring systems. We propose a distributed mechanism to arrange the routing for transmitting...
WSN(Wireless sensor network) depicted as an emerging technology, with its potential applications in the field of territory monitoring and industrial applications. The sensors employed in the surrounding environment will monitor the physical attribute changes such as temperature, humidity, etc. and makes notice of the data being gathered and delivers the gathered information to the (BS) base station...
When applying updates on distributed network elements with SDN, intra-update states may violate desired network properties, such as drop- and loop-freeness. Current stateless approaches cannot guarantee the constancy of arbitrary network invariants (correctness) in general, yet update procedures guaranteeing certain invariants do exist. In this paper, we investigate on update consistency for the case...
An interrelation between a topological design of network and efficient algorithm on it is important for communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles...
Delay and disruption tolerant networks (DTNs) adopt the store-carry-and-forward paradigm. Each node stores messages in buffer storage and waits for either an appropriate forwarding opportunity or the message's expiration time, i.e., its time-to-live (TTL). There are two key issues that influence the performance of DTN routing: (1) the forwarding policy that determines whether a message should be forwarded...
Routing in delay tolerant network (DTN) closely depends on the cooperation of nodes. At present, there are many works exploring the impact of the selfish behavior. However, most of these works assume that there is only one source-destination pair, and the source just generates one message. For this reason, this paper studies the impact of selfish behavior when many messages are transmitted at the...
In this paper, we define a collision area in a heterogeneous cellular network for the purpose of interference management between Device-to-Device (D2D) and conventional cellular (CC) communications. Currently, most D2D routing algorithms assume synchronized accurate location knowledge among users and the base stations. In reality, this level of location accuracy is difficult and power consuming in...
We consider wireless sensor networks (WSN) powered by energy harvested from the environment, which is assumed to be sporadic and random in nature. Wireless nodes in such networks experience random active and sleep periods depending on their energy availability, leading to intermittent connectivity in the network. This paper addresses the problem of minimizing the multi-hop transmission delay in such...
The majority of the routing protocols designed to date for mobile ad hoc networks (MANET) rely on flooding of route requests for the establishment of routes on demand. A novel approach called CBORCA (Cut-Based On-demand Routing with Coordinate Awareness) is introduced. CBORCA improves the efficiency with which route requests are disseminated by partitioning the designated route forwarders in distinct...
In Delay Tolerant Networks (DTNs), the connections between mobile nodes are intermittent and constant end-to-end paths rarely exist. In recent years, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interests in DTN routing design. However, most of these algorithms always select the same next hop as relay under the...
It has been observed that opportunistic networks exhibit a highly unbalanced traffic load distribution, mainly because of the heterogeneity in mobility and the greedy routing decisions, leading to packet drops due to storage constraints. The existing strategies rely either on fairness techniques or on diverting traffic to alternative routes in order to control congestion. The result is a dilemma between...
This paper studies the exact per node throughput capacity of a MANET, where the transmission power of each node can be controlled to adapt to a specified transmission range v and a generalized two-hop relay with limited packet redundancy f is adopted for packet routing. Based on the concept of automatic feedback control and the Markov chain model, we first develop a general theoretical framework to...
Wireless sensor Networks (WSNs), is one of the most rapidly growing scientific domain. This is because of the development of advanced sensor nodes with extremely low cost One of the characteristic feature of WSNs compared to the traditional wireless communication networks to reduce “delay” in such networks we introduce replication or “spraying” methods that can reduce the overhead of flooding-based...
In this paper, an opportunistic multi-copy two-hop routing algorithm is proposed for mobile social networks (MSNs) to minimize the expected data delivery delay, using local information. For each source-destination pair, the source dynamically maintains a forwarding set consisting of relay nodes. The forwarding set selection is based on the number of remaining message copies, as well as the number...
We present an analytical framework to investigate the interplay between a communication graph and an overlay of social relationships. Particularly, we focus on geographical distance as the key element that interrelates the concept of routing in a communication network with interaction patterns on the social graph. Through this regime, we attempt to identify classes of social relationships that let...
Opportunistic routing is studied as a representative example of location-aware greedy routing schemes. The routing process between an arbitrary source-destination pair is modeled as a directed random walk between the two ends in the underlying graph. The mean number of transmissions as well as the average multi-hop distance between arbitrary nodes are unified under a conceptual measure called expected...
In this paper, we present an efficient routing algorithm, Plankton, for Delay/Disruptive Tolerant Network (DTN). Plankton utilizes replica control to reduce overhead and contact probability estimates to improve performance. Plankton has two major features. First, it uses a combination of both short-term bursty contacts and long-term association based statistics for contact prediction. Second, it dynamically...
This paper proposes an optimal strategy for power allocation algorithm for source and relay nodes in multihop cognitive radio network that minimizes the outage probability of data transmission while meeting the constraints of interference to primary user and total transmit power of cognitive radio users. Overall objective is to enhance the network lifetime along with an increase in sum (total) transmission...
The paper describes the concept of neighborhood cooperation in context of the Wireless Sensor Network, in which each node can identify and communicate with neighbors around it. The innovative spatial routing scheme shapes an area where the packet retransmission toward the base station can take effect. In this work, the retransmission rules that use notion of actions limited to node's neighborhood...
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.