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.
Interference reduction is very crucial in sensor network for the economy of attached battery power. We propose a technique for extracting a backbone network from a given node distribution such that the extracted network exhibits reduced interference property. We describe a centralized algorithm for constructing backbone network which runs in O(n2) time, where n is the number of nodes in the sensor...
MPLS network architecture does not protect the confidentiality of data transmitted. This paper proposes a mechanism to enhance the security in MPLS networks by using multi-path routing combined with a modified (k, n) threshold secret sharing scheme. An IP packet entering MPLS ingress router can be partitioned into n shadow (share) packets, which are then assigned to maximally-node disjoint paths across...
Advances in telecommunication networks have allowed WDM to emerge as a viable solution to the ever-increasing demands of the Internet. Because these networks carry large amounts of traffic, alternate routing methods are designed in order to allow traffic to be properly re-routed from source to destination in the event of certain events, such as link blocking or failure. In this paper, we consider...
In this paper, we presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. We considered the idealized unit disk graph model in which nodes are assumed to be connected if and only if nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to extract the connected, planar graph for routing...
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.