The Experts below are selected from a list of 174054 Experts worldwide ranked by ideXlab platform
Arunabha Sen - One of the best experts on this subject based on the ideXlab platform.
-
relay node placement under budget constraint
Pervasive and Mobile Computing, 2019Co-Authors: Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matinmoghaddam, Saharnaz Mehrani, Arunabha SenAbstract:Abstract The relay node placement problem in the wireless sensor Network Domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected Network of sensor and relay nodes. Nevertheless, one would still like to design a Network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a Network with “maximal connectedness” subject to a fixed budget constraint.
-
relay node placement under budget constraint
International Conference of Distributed Computing and Networking, 2018Co-Authors: Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matinmoghaddam, Saharnaz Mehrani, Arunabha SenAbstract:The relay node placement problem in the wireless sensor Network Domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the Network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the Network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected Network but one would still like to design a Network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the "connectedness" of a disconnected graph. We study a family of problems whose goal is to design a Network with "maximal connectedness" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.
Chenyang Zhou - One of the best experts on this subject based on the ideXlab platform.
-
relay node placement under budget constraint
Pervasive and Mobile Computing, 2019Co-Authors: Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matinmoghaddam, Saharnaz Mehrani, Arunabha SenAbstract:Abstract The relay node placement problem in the wireless sensor Network Domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected Network of sensor and relay nodes. Nevertheless, one would still like to design a Network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a Network with “maximal connectedness” subject to a fixed budget constraint.
-
relay node placement under budget constraint
International Conference of Distributed Computing and Networking, 2018Co-Authors: Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matinmoghaddam, Saharnaz Mehrani, Arunabha SenAbstract:The relay node placement problem in the wireless sensor Network Domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the Network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the Network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected Network but one would still like to design a Network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the "connectedness" of a disconnected graph. We study a family of problems whose goal is to design a Network with "maximal connectedness" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.
R J Meijer - One of the best experts on this subject based on the ideXlab platform.
-
dynamic paths in multi Domain optical Networks for grids
Future Generation Computer Systems, 2005Co-Authors: S Van Oudenaarde, Z W Hendrikse, Freek Dijkstra, Leon Gommans, C T A M De Laat, R J MeijerAbstract:Many Grid applications require high bandwidth end-to-end connections between Grid resources in different Domains. Fiber optic Networks, owned by different providers, have to cooperate in a coordinated manner in order to provide an end-to-end connection. Currently, multi-Domain optical Network solutions require paper-based long-term contracts between administrative Domains. This paper describes a solution for dynamically creating optical connections between different autonomous Domains. This was implemented in the form of a Grid Service following the Open Grid Service Architecture. In our prototype, each switch belongs to a different Network Domain. Our Grid Service uses a toolkit based on the Generic Authorization, Authentication, and Accounting framework. This toolkit authorizes the use of optical infrastructure elements based on specific policies that are active within each Domain. To complete our multi-Domain authorization architecture, a Broker Service was also implemented. Our Broker Service interacts with the Grid Service instances to provide Grid application with a simplified way to set up end-to-end connections on demand.
David Lowe - One of the best experts on this subject based on the ideXlab platform.
-
on the use of nonlocal and nonpositive definite basis functions in radial basis function Networks
International Conference on Artificial Neural Networks, 1995Co-Authors: David LoweAbstract:It is invariably the case that when an application is developed using the radial basis function Network in the neural Network Domain, it is constructed using Gaussian basis functions. This paper discusses the rationale for employing alternative basis functions to the prevalent Gaussian. In particular, we argue the case in support of unbounded basis functions and nonpositive definite basis functions. The use of unbounded and nonpositive basis functions, though counterintuitive in application Domains such as classification and time series forecasting, have a good theoretical motivation from the Domains of functional interpolation and, somewhat surprisingly, kernel-based density estimation. In addition to collating the theoretical arguments, we present a performance comparison between Gaussian and unbounded, nonpositive definite basis functions in a radial basis function Network applied to a financial derivatives regression problem: estimating the price of $/DM options contracts.
Jong Hyuk Park - One of the best experts on this subject based on the ideXlab platform.
-
An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking
Sustainability, 2015Co-Authors: Jinhyung Park, Young-sik Jeong, Jong Hyuk ParkAbstract:Legacy Networks do not open the precise information of the Network Domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new Network requirements, the concept of software-defined Networking (SDN) has been developed as a technological alternative to overcome the limitations of the legacy Network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN) in the SDN environment. The proposed SDN routing computation (SRC) application is designed and applied in a multi-Domain Network for the efficient use of resources, selection of the optimal path between the multi-Domains and optimal establishment of end-to-end connections.
-
novel approaches to enhance mobile wimax security
Eurasip Journal on Wireless Communications and Networking, 2010Co-Authors: Taeshik Shon, Jong Hyuk Park, Bonhyun Koo, Hangbae ChangAbstract:The IEEE 802.16 Working Group on Broadband Wireless Access Standards released IEEE 802.16-2004 which is a standardized technology for supporting broadband and wireless communication with fixed and nomadic access. After the IEEE 802.16-2004 standard, a new advanced and revised standard was released as the IEEE 802.16e-2005 amendment which is foundation of Mobile WiMAX Network supporting handover and roaming capabilities. In the area of security aspects, compared to IEEE 802.16-2004, IEEE 802.16e, called Mobile WiMAX, adopts improved security architecture--PKMv2 which includes EAP authentication, AES-based authenticated encryption, and CMAC or HMAC message protection. However, there is no guarantee that PKMv2-based Mobile WiMAX Network will not have security flaws. In this paper, we investigate the current Mobile WiMAX security architecture focusing mainly on pointing out new security vulnerabilities such as a disclosure of security context in Network entry, a lack of secure communication in Network Domain, and a necessity of efficient handover supporting mutual authentication. Based on the investigation results, we propose a novel Mobile WiMAX security architecture, called RObust and Secure MobilE WiMAX (ROSMEX), to prevent the new security vulnerabilities.