期刊文献+
共找到10,749篇文章
< 1 2 250 >
每页显示 20 50 100
Cooperative Channel and Optimized Route Selection in Adhoc Network 被引量:1
1
作者 D.Manohari M.S.Kavitha +1 位作者 K.Periyakaruppan B.Chellapraba 《Intelligent Automation & Soft Computing》 SCIE 2023年第5期1547-1560,共14页
Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.D... Over the last decade,mobile Adhoc networks have expanded dramati-cally in popularity,and their impact on the communication sector on a variety of levels is enormous.Its uses have expanded in lockstep with its growth.Due to its instability in usage and the fact that numerous nodes communicate data concur-rently,adequate channel and forwarder selection is essential.In this proposed design for a Cognitive Radio Cognitive Network(CRCN),we gain the confidence of each forwarding node by contacting one-hop and second level nodes,obtaining reports from them,and selecting the forwarder appropriately with the use of an optimization technique.At that point,we concentrate our efforts on their channel,selection,and lastly,the transmission of data packets via the designated forwarder.The simulation work is validated in this section using the MATLAB program.Additionally,steps show how the node acts as a confident forwarder and shares the channel in a compatible method to communicate,allowing for more packet bits to be transmitted by conveniently picking the channel between them.We cal-culate the confidence of the node at the start of the network by combining the reliability report for thefirst hop and the reliability report for the secondary hop.We then refer to the same node as the confident node in order to operate as a forwarder.As a result,we witness an increase in the leftover energy in the output.The percentage of data packets delivered has also increased. 展开更多
关键词 Adhoc network confident FORWARDER one-hop optimized route selection secondary report channel selection
下载PDF
Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network
2
作者 V.Krishnakumar R.Asokan 《Computer Systems Science & Engineering》 SCIE EI 2023年第4期985-1000,共16页
Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,local... Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks. 展开更多
关键词 Mobile ad hoc networks(MANETs) geographical graph-based mapping(GGM) geographic drone based route optimization data speed anchor node’s
下载PDF
Blockchain Driven Metaheuristic Route Planning in Secure Wireless Sensor Networks
3
作者 M.V.Rajesh T.Archana Acharya +5 位作者 Hafis Hajiyev E.Laxmi Lydia Haya Mesfer Alshahrani Mohamed K Nour Abdullah Mohamed Mesfer Al Duhayyim 《Computers, Materials & Continua》 SCIE EI 2023年第1期933-949,共17页
Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vi... Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches. 展开更多
关键词 Internet of things wireless sensor networks ROUTING metaheuristics blockchain
下载PDF
Secure and Energy Concise Route Revamp Technique in Wireless Sensor Networks
4
作者 S.M.Udhaya Sankar Mary Subaja Christo P.S.Uma Priyadarsini 《Intelligent Automation & Soft Computing》 SCIE 2023年第2期2337-2351,共15页
Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,... Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,expanding the life duration of sensing devices by improving data depletion in an effective and sustainable energy-efficient way remains a challenge.Also,the clustering strategy employs to enhance or extend the life cycle of WSNs.We identify the supervisory head node(SH)or cluster head(CH)in every grouping considered the feasible strategy for power-saving route discovery in the clustering model,which diminishes the communication overhead in the WSN.However,the critical issue was determining the best SH for ensuring timely communication services.Our secure and energy concise route revamp technology(SECRET)protocol involves selecting an energy-concise cluster head(ECH)and route revamping to optimize navigation.The sensors transmit information over the ECH,which delivers the information to the base station via the determined optimal path using our strategy for effective data transmission.We modeled our methods to accom-plish power-efficient multi-hop routing.Furthermore,protected navigation helps to preserve energy when routing.The suggested solution improves energy savings,packet delivery ratio(PDR),route latency(RL),network lifetime(NL),and scalability. 展开更多
关键词 Wireless sensor network wireless security wireless routing CLUSTERING ad hoc network
下载PDF
Enhanced Metaheuristics with Trust Aware Route Selection for Wireless Sensor Networks
5
作者 A.Francis Saviour Devaraj T.Satyanarayana Murthy +3 位作者 Fayadh Alenezi E.Laxmi Lydia Mohamad Adzhar Md Zawawi Mohamad Khairi Ishak 《Computer Systems Science & Engineering》 SCIE EI 2023年第8期1431-1445,共15页
Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in t... Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches. 展开更多
关键词 SECURITY wireless sensor networks trust factor routing protocol PRIVACY
下载PDF
Combined Linear Multi-Model for Reliable Route Recommender in Next Generation Network
6
作者 S.Kalavathi R.Nedunchelian 《Intelligent Automation & Soft Computing》 SCIE 2023年第4期39-56,共18页
Network analysis is a promisingfield in the area of network applications as different types of traffic grow enormously and exponentially.Reliable route prediction is a challenging task in the Large Scale Networks(LSN).V... Network analysis is a promisingfield in the area of network applications as different types of traffic grow enormously and exponentially.Reliable route prediction is a challenging task in the Large Scale Networks(LSN).Various non-self-learning and self-learning approaches have been adopted to predict reliable routing.Routing protocols decide how to send all the packets from source to the destination addresses across the network through their IP.In the current era,dynamic protocols are preferred as they network self-learning internally using an algorithm and may not entail being updated physically more than the static protocols.A novel method named Reliable Route Prediction Model(RRPM)is proposed tofind the best routes in the given hefty gage network to balance the load of the entire network to advance the network recital.The task is carried out in two phases.In thefirst phase,Network Embedding(NE)based node classification is carried out.The second phase involves the network analysis to predict the route of the LSN.The experiment is carried out for average data transmission and rerouting time is measured between RRPM and Routing Information Protocol(RIP)protocol models with before and after failure links.It was observed that average transmission time for RIP protocol has measured as 18.5 ms and RRPM protocol has measured as 18.2 ms.Hence the proposed RRPM model outperforms well than the traditional routefinding protocols such as RIP and Open Shortest Path First(OSPF). 展开更多
关键词 network embedding node classification link prediction routing protocols novel RRPM
下载PDF
Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm 被引量:9
7
作者 Wang Shijin Li Qingyun +1 位作者 Cao Xi Li Haiyun 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2016年第4期469-478,共10页
Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct... Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%. 展开更多
关键词 air route network planning three area avoidance optimization of air route network node adaptive ant colony algorithm grid environment
下载PDF
AODV-RM:route maintenance against route flapping in Ad hoc network
8
作者 叶亮 沙学军 徐玉滨 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2011年第2期17-22,共6页
Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes... Route flapping is common in mobile Ad hoc networks.It usually causes large delay or even interruption during communication.This paper proposed a routing protocol AODV-RM to alleviate this effect.AODV-RM selects routes with the lightest traffic load,to avoid striving for hot nodes with other users,hence minishes the chance of collision.AODV-RM keeps all valid routes to the destination in its routing table as backups.When the link under usage breaks down,AODV-RM shifts to a valid route in its routing table instead of route repair or researching,which ensures the continuity of communication.AODV-RM chooses a route maintenance scheme by the network topology.If the origination has multi routes to the destination,only the origination maintains routes.Otherwise,middle nodes,instead of the origination,maintain sub-routes to the destination.By simulating the traditional AODV and AODV-RM,the results showed that AODV-RM has a lower drop rate and better performance against route flapping. 展开更多
关键词 route flapping route maintenance routing protocol Ad hoe network
下载PDF
Route Optimization for Network Mobility Based Aeronautical Network Using Correspondent Router
9
作者 Ruoshan Kong Jing Feng Huaibei Zhou 《International Journal of Communications, Network and System Sciences》 2011年第10期667-673,共7页
The future aeronautical network will be based on IPv6 and the services over the aeronautical network will be classified into 3 domains: Air Traffic Services (ATS), Airline Operational Services (AOS) and Passenger Info... The future aeronautical network will be based on IPv6 and the services over the aeronautical network will be classified into 3 domains: Air Traffic Services (ATS), Airline Operational Services (AOS) and Passenger Information and Entertainment Services (PIES), among which the ATS and AOS domains are important for aircraft safety and airline business operation. Some schemes have been proposed to provide IP mobility support for aeronautical network, and Network Mobility (NEMO) scheme is the most promising one. However, using NEMO technology will lead to sub-optimal routing, so route optimization technology is highly desired for NEMO. A route optimization scheme is proposed for the ATS and AOS domains, which introduces the Correspondent Routers to realize the optimal routing and employs an improved procedure to reduce the handoff delay. The route optimization for the PIES domain is also discussed to provide better performance for some special scenarios. 展开更多
关键词 Aeronautical network network MOBILITY route OPTIMIZATION Correspondent routeR
下载PDF
Analysis of the Chinese air route network as a complex network 被引量:29
10
作者 Cai Kai-Quan Zhang Jun +1 位作者 Du Wen-Bo Cao Xian-Bin 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第2期596-602,共7页
The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (C... The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN). Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems. 展开更多
关键词 complex network Chinese air route network air transportation
下载PDF
A Throughput-Aware Joint Vehicle Route and Access Network Selection Approach Based on SMDP 被引量:3
11
作者 Jiandong Xie Sa Xiao +2 位作者 Ying-Chang Liang Li Wang Jun Fang 《China Communications》 SCIE CSCD 2020年第5期243-265,共23页
In intelligent transportation system(ITS), the interworking of vehicular networks(VN) and cellular networks(CN) is proposed to provide high-data-rate services to vehicles. As the network access quality for CN and VN i... In intelligent transportation system(ITS), the interworking of vehicular networks(VN) and cellular networks(CN) is proposed to provide high-data-rate services to vehicles. As the network access quality for CN and VN is location related, mobile data offloading(MDO), which dynamically selects access networks for vehicles, should be considered with vehicle route planning to further improve the wireless data throughput of individual vehicles and to enhance the performance of the entire ITS. In this paper, we investigate joint MDO and route selection for an individual vehicle in a metropolitan scenario. We aim to improve the throughput of the target vehicle while guaranteeing its transportation efficiency requirements in terms of traveling time and distance. To achieve this objective, we first formulate the joint route and access network selection problem as a semi-Markov decision process(SMDP). Then we propose an optimal algorithm to calculate its optimal policy. To further reduce the computation complexity, we derive a suboptimal algorithm which reduces the action space. Simulation results demonstrate that the proposed optimal algorithm significantly outperforms the existing work in total throughput and the late arrival ratio.Moreover, the heuristic algorithm is able to substantially reduce the computation time with only slight performance degradation. 展开更多
关键词 mobile data offloading network selection route selection semi-Markov decision process vehicular network
下载PDF
Energy-constrained ferry route design for sparse wireless sensor networks 被引量:2
12
作者 王勇 彭伟 +1 位作者 窦强 龚正虎 《Journal of Central South University》 SCIE EI CAS 2013年第11期3142-3149,共8页
In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such ... In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution. 展开更多
关键词 message ferry energy-constrained route design integer linear programming wireless sensor networks
下载PDF
Air Route Network Generation Based on Traffic Assignment 被引量:2
13
作者 WANG Shijin LIN Jingjing HAN Yunxuan 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2020年第2期223-231,共9页
Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has b... Air route network is the carrier of air traffic flow,and traffic assignment is a method to verify the rationality of air route network structure.Therefore,air route network generation based on traffic assignment has been becoming the research focus of airspace programming technology.Based on link prediction technology and optimization theory,a bi-level programming model is established in the paper.The model includes an upper level of air route network generation model and a lower level of traffic assignment model.The air route network structure generation incorporates network topology generation algorithm based on link prediction technology and optimal path search algorithm based on preference,and the traffic assignment adopts NSGA-Ⅲalgorithm.Based on the Python platform NetworkX complex network analysis library,a network of 57 airports,383 nodes,and 635 segments within China Airspace Beijing and Shanghai Flight Information Regions and 187975 sorties of traffic are used to simulate the bilevel model.Compared with the existing air route network,the proposed air route network can decrease the cost by 50.624%,lower the flight conflict coefficient by 33.564%,and reduce dynamic non-linear coefficient by 7.830%. 展开更多
关键词 air route network link prediction traffic assignment bi-level programming NSGA-Ⅲ algorithm
下载PDF
Reliable energy-efficient routing with novel route update in wireless sensor networks 被引量:1
14
作者 R. VIDHYAPRIYA P. T. VANATHI 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2008年第8期1099-1110,共12页
In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy availa... In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the re-ceived signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct ad-vantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simul-taneous packet forwarding. 展开更多
关键词 Wireless sensor networks (WSNs) Routing Energy efficiency Received signal strength indicator (RSSI) route repair WAYPOINT
下载PDF
Implementation of ZigBee Network Layer Based on AODVjr and Tree Hirarchical Route Algorisms 被引量:1
15
作者 Qiyong Pan Jin Wu +1 位作者 Yihuai Wang Jingfei Ni 《Journal of Software Engineering and Applications》 2011年第8期487-490,共4页
The basic functions and the relative concepts of ZigBee network are analyzed in this paper. The implementation method of ZigBee network layer is proposed, it includes how to build a new network, add a node to the netw... The basic functions and the relative concepts of ZigBee network are analyzed in this paper. The implementation method of ZigBee network layer is proposed, it includes how to build a new network, add a node to the network, send data and receive data. The distributing address assigning mechanism, the tree hierarchical route algorism and AODVjr algorism are implemented. Finally, the ZigBee network layer protocol is tested. 展开更多
关键词 ZIGBEE network AODVJR route Choosing route Finding
下载PDF
Route Temporal⁃Spatial Information Based Residual Neural Networks for Bus Arrival Time Prediction 被引量:1
16
作者 Chao Yang Xiaolei Ru Bin Hu 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2020年第4期31-39,共9页
Bus arrival time prediction contributes to the quality improvement of public transport services.Passengers can arrange departure time effectively if they know the accurate bus arrival time in advance.We proposed a mac... Bus arrival time prediction contributes to the quality improvement of public transport services.Passengers can arrange departure time effectively if they know the accurate bus arrival time in advance.We proposed a machine⁃learning approach,RTSI⁃ResNet,to forecast the bus arrival time at target stations.The residual neural network framework was employed to model the bus route temporal⁃spatial information.It was found that the bus travel time on a segment between two stations not only had correlation with the preceding buses,but also had common change trends with nearby downstream/upstream segments.Two features about bus travel time and headway were extracted from bus route including target section in both forward and reverse directions to constitute the route temporal⁃spatial information,which reflects the road traffic conditions comprehensively.Experiments on the bus trajectory data of route No.10 in Shenzhen public transport system demonstrated that the proposed RTSI⁃ResNet outperformed other well⁃known methods(e.g.,RNN/LSTM,SVM).Specifically,the advantage was more significant when the distance between bus and the target station was farther. 展开更多
关键词 bus arrival time prediction route temporal⁃spatial information residual neural network recurrent neural network bus trajectory data
下载PDF
Designs of 3D Mesh and Torus Optical Network-on-Chips:Topology,Optical Router and Routing Module 被引量:3
17
作者 Lei Guo Weigang Hou Pengxing Guo 《China Communications》 SCIE CSCD 2017年第5期17-29,共13页
As a nanometer-level interconnection,the Optical Network-on-Chip(ONoC)was proposed since it was typically characterized by low latency,high bandwidth and power efficiency. Compared with a 2-Dimensional(2D)design,the 3... As a nanometer-level interconnection,the Optical Network-on-Chip(ONoC)was proposed since it was typically characterized by low latency,high bandwidth and power efficiency. Compared with a 2-Dimensional(2D)design,the 3D integration has the higher packing density and the shorter wire length. Therefore,the 3D ONoC will have the great potential in the future. In this paper,we first discuss the existing ONoC researches,and then design mesh and torus ONoCs from the perspectives of topology,router,and routing module,with the help of 3D integration. A simulation platform is established by using OPNET to compare the performance of 2D and 3D ONoCs in terms of average delay and packet loss rate. The performance comparison between 3D mesh and 3D torus ONoCs is also conducted. The simulation results demonstrate that 3D integration has the advantage of reducing average delay and packet loss rate,and 3D torus ONoC has the better performance compared with 3D mesh solution. Finally,we summarize some future challenges with possible solutions,including microcosmic routing inside optical routers and highly-efficient traffic grooming. 展开更多
关键词 Optical network-on-Chip topology and optical router routing module
下载PDF
ROUTE SELECTION IN VIRTUAL CIRCUIT DATA NETWORKS BASED ON GENETIC ALGORITHMS
18
作者 He Cuihong Ou Yishan(Guangdong Institute of Technology, Guangzhou 510090)Cheng Huowang(University of National Defense of Technology, Changsha 410073) 《Journal of Electronics(China)》 1997年第4期311-317,共7页
This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously ... This paper addresses the problem of selecting a route for every pair of communicating nodes in a virtual circuit data network in order to minimize the average delay encountered by messages. The problem was previously modeled as a network of M/M/1 queues. Agenetic algorithm to solve this problem is presented. Extensive computational results across a variety of networks are reported. These results indicate that the presented solution procedure outperforms the other methods in the literature and is effective for a wide range of traffic loads. 展开更多
关键词 route SELECTION VIRTUAL CIRCUIT data networks GENETIC ALGORITHMS
下载PDF
Navigation Route Based Stable Clustering for Vehicular Ad Hoc Networks
19
作者 Zhiwei Yang Weigang Wu +2 位作者 Yishun Chen Xiaola Lin Xiang Chen 《China Communications》 SCIE CSCD 2018年第3期42-56,共15页
Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the informa... Due to high node mobility, stability has been always one of the major concerns of vehicle clustering algorithms in vehicular ad hoc networks. In this paper, we propose a novel clustering algorithm based on the information of routes planned by vehicular navigation systems. In the clustering algorithm, we design a residual route time function to quantitatively calculate the overlapping time among vehicles based on route information, with which a novel clusterhead selection metric is presented. We further design a mechanism of future-clusterhead, which can help avoid message exchanges at intersections and reduce the overhead of cluster maintenance. The simulation results show that, compared with previous works, our clustering algorithm can achieve higher stability and at the same time lower communication cost. 展开更多
关键词 VANET CLUSTERING mobile com-puting navigation route ad hoc networks
下载PDF
An Improved FN Algorithm for Community Division of Air Route Network
20
作者 ZHAO Zheng ZHANG Saiwen +1 位作者 XU Lipeng HU Li 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2020年第4期630-637,共8页
Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic t... Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic traffic flow demand is ignored.The result of the division is only structurally optimal.To improve the accuracy of community division,based on the static topology of air route network,the concept of network traffic contribution degree is put forward.The concept of operational research is introduced to optimize the network adjacency matrix to form an improved community division algorithm.The air route network in East China is selected as the object of algorithm comparison experiment,including 352 waypoints and 928 segments.The results show that the improved algorithm has a more ideal effect on the division of the community structure.The proportion of the number of nodes included in the large community has increased by 21.3%,and the modularity value has increased from 0.756 to 0.806,in which the modularity value is in the range of[-0.5,1).The research results can provide theoretical and technical support for the optimization of flight schedules and the rational use of air route resources. 展开更多
关键词 air route network community division topological structure traffic flow contribution
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部