• Title/Summary/Keyword: mobile cluster

Search Result 308, Processing Time 0.029 seconds

A Genetic-Algorithm-Based Optimized Clustering for Energy-Efficient Routing in MWSN

  • Sara, Getsy S.;Devi, S. Prasanna;Sridharan, D.
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.922-931
    • /
    • 2012
  • With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

Cluster Robots Line formatted Navigation Based on Virtual Hill and Virtual Sink (Virtual Hill 및 Sink 개념 기반의 군집 로봇의 직선 대형 주행 기법)

  • Kang, Yo-Hwan;Lee, Min-Cheol;Kim, Chi-Yen;Yoon, Sung-Min;Noh, Chi-Bum
    • The Journal of Korea Robotics Society
    • /
    • v.6 no.3
    • /
    • pp.237-246
    • /
    • 2011
  • Robots have been used in many fields due to its performance improvement and variety of its functionality, to the extent which robots can replace human tasks. Individual feature and better performance of robots are expected and required to be created. As their performances and functions have increased, systems have gotten more complicated. Multi mobile robots can perform complex tasks with simple robot system and algorithm. But multi mobile robots face much more complex driving problem than singular driving. To solve the problem, in this study, driving algorithm based on the energy method is applied to the individual robot in a group. This makes a cluster be in a formation automatically and suggests a cluster the automatic driving method so that they stably arrive at the target. The energy method mentioned above is applying attractive force and repulsive force to a special target, other robots or obstacles. This creates the potential energy, and the robot is controlled to drive in the direction of decreasing energy, which basically satisfies lyapunov function. Through this method, a cluster robot is able to create a formation and stably arrives at its target.

A Hierarchical Time Division Multiple Access Medium Access Control Protocol for Clustered Underwater Acoustic Networks

  • Yun, Changho;Cho, A-Ra;Kim, Seung-Geun;Park, Jong-Won;Lim, Yong-Kon
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.3
    • /
    • pp.153-166
    • /
    • 2013
  • A hierarchical time division multiple access (HTDMA) medium access control (MAC) protocol is proposed for clustered mobile underwater acoustic networks. HTDMA consists of two TDMA scheduling protocols (i.e., TDMA1 and TDMA2) in order to accommodate mobile underwater nodes (UNs). TDMA1 is executed among surface stations (e.g., buoys) using terrestrial wireless communication in order to share mobility information obtained from UNs which move cluster to cluster. TDMA2 is executed among UNs, which send data to their surface station as a cluster head in one cluster. By sharing mobility information, a surface station can instantaneously determine the number of time slots in a TDMA2 frame up to as many as the number of UNs which is currently residing in its cluster. This can enhance delay and channel utilization performance by avoiding the occurrence of idle time slots. We analytically investigate the delay of HTDMA, and compare it with that of wellknown contention-free and contention-based MAC protocols, which are TDMA and Slotted-ALOHA, respectively. It is shown that HTDMA remarkably decreases delay, compared with TDMA and Slotted-ALOHA.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

Promotion Strategies for Daegu-Kyungbuk Mobile Cluster: Searching for Alternative Regional Innovation Governance (대구.경북 모바일 클러스터 육성전략: 지역혁신 거버넌스의 대안 모색)

  • Lee, Jeong-Hyop;Kim, Hyung-Joo
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.12 no.4
    • /
    • pp.477-493
    • /
    • 2009
  • This research aims to examine Korean regional innovation governance, find structural problems, and explore alternative strategies of regional innovation governance. Especially the alternative governance was searched through the case study of Daegu-Kyungbuk mobile cluster, of which formulation Samsung is the anchor institution. Regional innovation governance in this research is defined as a policy system to link knowledge generation & diffusion subsystem and knowledge application & exploitation subsystem, and institutional conditions to steer the system. "Social Capital Assessment Tool (SOCAT)" of the World Bank was utilized for the appreciation of cluster governance. The regional innovation governance of Daegu-Kyungbuk mobile cluster is characterized as production networks dominated by one-to-one relationship between Samsung and hardware/software developers, decentralized R&D networks and policy networks with multiple hubs. Major policy agents have not developed networks with local companies, and rare are interactions between the policy agents. Local companies, especially software developers, responded they have had experiences to cooperate for local problem solving and shared their community goal, however, the degree of trust in major local project leaders is not high. Local hardware/software developers with core technologies need to be cooperative to develop similar technologies or products in Daegu-Kyungbuk mobile cluster. Regional administrative actors, such as the City of Daegu and Kyungsangbuk-do, and diverse innovation-related institutes should build cooperative environment where diverse project-based cooperation units are incessantly created, taken apart, and recreated.

  • PDF

Cluster-based Energy-aware Data Sharing Scheme to Support a Mobile Sink in Solar-Powered Wireless Sensor Networks (태양 에너지 수집형 센서 네트워크에서 모바일 싱크를 지원하기 위한 클러스터 기반 에너지 인지 데이터 공유 기법)

  • Lee, Hong Seob;Yi, Jun Min;Kim, Jaeung;Noh, Dong Kun
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1430-1440
    • /
    • 2015
  • In contrast with battery-based wireless sensor networks (WSNs), solar-powered WSNs can operate for a longtime assuming that there is no hardware fault. Meanwhile, a mobile sink can save the energy consumption of WSN, but its ineffective movement may incur so much energy waste of not only itself but also an entire network. To solve this problem, many approaches, in which a mobile sink visits only on clustering-head nodes, have been proposed. But, the clustering scheme also has its own problems such as energy imbalance and data instability. In this study, therefore, a cluster-based energy-aware data-sharing scheme (CE-DSS) is proposed to effectively support a mobile sink in a solar-powered WSN. By utilizing the redundant energy efficiently, CE-DSS shares the gathered data among cluster-heads, while minimizing the unexpected black-out time. The simulation results show that CE-DSS increases the data reliability as well as conserves the energy of the mobile sink.

Performance analysis of the Resource Reservation Schemes using Mobile Cluster based H-MRSVP in Wireless Mobile Networks (무선 이동망에서 이동 클러스터 기반의 H-MRVP를 이용한 자원관리 기법의 성능 분석)

  • Ma, Gyeong-Min;Won, Jeong-Jae;Lee, Hyeong-U;Jo, Chung-Ho
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.283-292
    • /
    • 2002
  • This paper develops a scheme of resource management for guaranteeing QoS of realtime traffic in wireless mobile internet environments Mobile terminal has significant impact on the QoS originating mobility provided to a real-time application. The currently proposed MRSVP is not clear the boundary of resource reservation tregion and also can give rise to signal overhead to maintain sessions. To solve above problem, we propose the new reservation protocol, mobile cluster based H-MRSVP to combine MRSVP with moving cluster concept. In this paper, we analytically design our model for guaranteeing the QoS of realtime traffic and compare the three schemes: guard channel allocation schemes, DCA and our model. The performance measures are the probabilities of new call blocking, handoff dropping, resource utilization and service completion versus the system offered Erlang load. Consequently, Simulation indicate our model is more flexible than DCA in a view pint of channel utilization and gains the advantage over guard channel scheme with respects to the mobility.

A Reliable Cluster based Dynamic Authentication Mechanism in MANET (이동 애드혹 네트워크에서 신뢰성 있는 클러스터 기반 동적 인증 기법)

  • Hwang, Yoon-Cheol;Kim, Jin-Il
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.661-672
    • /
    • 2008
  • Mobile Ad-hoc NETwork is a kind of self-controlled network composed only of mobile hosts. Since its range of use is gradually expanding into various sections applicable to practical lives, active researches are being conducted on it. However, as it depends on cooperation of nodes composing the entire network, due to weakness of wireless link and lack of its central infrastructure, so it is exposed to more serious risk than general network in security. Therefore, this paper proposes Cluster-Based Dynamic Authentication that enables only reliable nodes to participate in communication, by solving lack of centralized infrastructure, using hierarchical Mobile Ad hoc NETwork structure based on cluster, and by complementing security weakness through mutual authentication between hierarchical nodes. Simulation shows that the proposed scheme can complement security weakness of Mobile Ad hoc NETwork and that it is more adequate in reliability and expandability than the existing schemes.

  • PDF

Group Dynamic Source Routing Protocol for Wireless Mobile Ad Hoc Networks (무선 이동 애드 혹 네트워크를 위한 동적 그룹 소스 라우팅 프로토콜)

  • Kwak, Woon-Yong;Oh, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1034-1042
    • /
    • 2008
  • It is very hard, but important to sustain path stability for a reliable communication in mobile ad hoc networks. We propose a novel source routing protocol that establishes a group path with virtual multiple paths to enable a robust communication. The entire mobile nodes form a disjoint set of clusters: Each has its clusterhead as a cluster leader and a unique cluster label to identify itself from other clusters. A group path is a sequence of cluster labels instead of nodes and the nodes with the same label collaborate to deliver packets to a node with next label on the group path. We prove by resorting to simulation that our proposed protocol outperforms the existing key routing protocols, even for a network with a high node mobility and a high traffic.

Advanced Stability Distributed Weighted Clustering Algorithm in the MANET (모바일 에드혹 네트워크에서 안정성을 향상시킨 분산 조합 가중치 클러스터링 알고리즘)

  • Hwang, Yoon-Cheol;Lee, Sang-Ho;Kim, Jin-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.33-42
    • /
    • 2007
  • Mobile ad-hoc network(MANET) can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infrastructure. But, Because of unrestriction for the participation and breakaway of node, it has the difficulty in management and stability which is a basic function of network operation. Therefore, to solve those problems, we suggest a distributed weighted clustering algorithm from a manageable and stable point of view. The suggested algorithm uses distributed weighted clustering algorithm when it initially forms the cluster and uses a concept which is distributed gateway and sub-cluster head to reduce the re-clustering to the minimum which occurs mobile nodes after forming the cluster. For performance evaluation, We compare DCA and WCA with the suggested algorithm on the basis of initial overhead, resubscriber rate and a number of cluster.

  • PDF