scholarly journals Self-Administered Information Sharing Framework Using Bioinspired Mechanisms

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Huibo Bi ◽  
Yanyan Chen ◽  
Wen-Long Shang ◽  
Chengcheng Song ◽  
Wenbo Huang
Keyword(s):  
Information Sharing ◽  
Information Acquisition ◽  
Heuristic Algorithms ◽  
Data Traffic ◽  
Data Packets ◽  
Battery Power ◽  
On Line ◽  
Save Energy ◽  
Bioinspired Algorithms ◽  
Information Collecting

The promising potential of distributed and interconnected lightweight devices that can jointly generate superior information-collecting and problem-solving abilities has long fostered various significant and ubiquitous techniques, from wireless sensor networks (WSNs) to Internet of Things (IoT). Although related applications have been widely used in different domains in attempting to collect and harness the ever-growing information flows, one major issue that impedes the further advancement of WSNs or IoT-based applications is the restricted battery power. Previous research mainly focuses on investigating novel protocols to save energy by reducing data traffic with the aid of optimal or heuristic algorithms. However, data packet behaviours and significant parameters involved are mostly preconfigured in a supervised-learning fashion rather than using an unsupervised learning paradigm and therefore may not adapt to uncertain or fast-changing environments. Hence, this paper concentrates on optimising the behaviours of data packets and significant parameters in a widely tested routing protocol, namely, Cognitive Packet Network (CPN), with the aid of several bio-inspired algorithms to increase the efficiency of energy usage and information acquisition. Two novel packet behaviours are introduced, and an on-line parameter calibration scheme is proposed to realise packet time-to-live (TTL) adjustment and rate adaptation. The simulation results show that the introduction of the bioinspired algorithms can improve the efficiency of information sharing and reduce the energy consumption.

Heuristic Algorithms for Waste Load Allocation in a River Basin

1989 ◽  
Vol 21 (8-9) ◽  
pp. 1057-1064 ◽  
Author(s):  
Vijay Joshi ◽  
Prasad Modak
Keyword(s):  
Dynamic Programming ◽  
Heuristic Algorithms ◽  
Water Quality Management ◽  
User Preferences ◽  
Theory And Practice ◽  
Waste Load Allocation ◽  
Practical Applications ◽  
Waste Load ◽  
On Line ◽  
The One

Waste load allocation for rivers has been a topic of growing interest. Dynamic programming based algorithms are particularly attractive in this context and are widely reported in the literature. Codes developed for dynamic programming are however complex, require substantial computer resources and importantly do not allow interactions of the user. Further, there is always resistance to utilizing mathematical programming based algorithms for practical applications. There has been therefore always a gap between theory and practice in systems analysis in water quality management. This paper presents various heuristic algorithms to bridge this gap with supporting comparisons with dynamic programming based algorithms. These heuristics make a good use of the insight gained in the system's behaviour through experience, a process akin to the one adopted by field personnel and therefore can readily be understood by a user familiar with the system. Also they allow user preferences in decision making via on-line interaction. Experience has shown that these heuristics are indeed well founded and compare very favourably with the sophisticated dynamic programming algorithms. Two examples have been included which demonstrate such a success of the heuristic algorithms.

scholarly journals A Highly Effective Route for Real-Time Traffic Using an IoT Smart Algorithm for Tele-Surgery Using 5G Networks

2021 ◽  
Vol 10 (2) ◽  
pp. 30
Author(s):  
Radwan S. Abujassar ◽  
Husam Yaseen ◽  
Ahmad Samed Al-Adwan
Keyword(s):  
Live Streaming ◽  
Data Traffic ◽  
Data Packets ◽  
Real Time Traffic ◽  
Medical Quality ◽  
Optimal Smoothing ◽  
Patient Will ◽  
Three Stages ◽  
Exchange Data

Nowadays, networks use many different paths to exchange data. However, our research will construct a reliable path in the networks among a huge number of nodes for use in tele-surgery using medical applications such as healthcare tracking applications, including tele-surgery which lead to optimizing medical quality of service (m-QoS) during the COVID-19 situation. Many people could not travel due to the current issues, for fear of spreading the covid-19 virus. Therefore, our paper will provide a very trusted and reliable method of communication between a doctor and his patient so that the latter can do his operation even from a far distance. The communication between the doctor and his/her patient will be monitored by our proposed algorithm to make sure that the data will be received without delay. We test how we can invest buffer space that can be used efficiently to reduce delays between source and destination, avoiding loss of high-priority data packets. The results are presented in three stages. First, we show how to obtain the greatest possible reduction in rate variability when the surgeon begins an operation using live streaming. Second, the proposed algorithm reduces congestion on the determined path used for the online surgery. Third, we have evaluated the affection of optimal smoothing algorithm on the network parameters such as peak-to-mean ratio and delay to optimize m-QoS. We propose a new Smart-Rout Control algorithm (s-RCA) for creating a virtual smart path between source and destination to transfer the required data traffic between them, considering the number of hops and link delay. This provides a reliable connection that can be used in healthcare surgery to guarantee that all instructions are received without any delay, to be executed instantly. This idea can improve m-QoS in distance surgery, with trusted paths. The new s-RCA can be adapted with an existing routing protocol to track the primary path and monitor emergency packets received in node buffers, for direct forwarding via the demand path, with extended features.

Sharing Demand Information with Retailer Under Upstream Competition

2021 ◽  
Author(s):  
Aditya Jain
Keyword(s):  
Information Sharing ◽  
Private Information ◽  
Operations Management ◽  
Information Acquisition ◽  
Wholesale Price ◽  
Substitutable Products ◽  
Downward Pressure ◽  
Demand Information ◽  
Intensity Of Competition ◽  
Share Information

We analyze demand information sharing collaboration between two manufacturers and a retailer under upstream competition. The manufacturers produce partially substitutable products, which are stocked by the retailer that sells them in the market characterized by random demand. The manufacturers are privately informed about uncertain demand and decide on whether to share this information with the retailer. We show that by not sharing information, a manufacturer ends up distorting its wholesale price upward to signal its private information to the retailer, and under upstream competition, this distortion is propagated to the competing manufacturer. Thus, although a manufacturer’s decision to not share information may benefit or hurt its own profit, this always benefits the competing manufacturer. Under low intensity of competition, signaling-driven distortions exacerbate double marginalization and hurt all parties, whereas under more intense competition, these distortions help manufacturers offset downward pressure on wholesale prices. Thus, in equilibrium similarly informed manufacturers share information in the former case but not in the latter case. Additionally, when manufacturers differ in their information accuracies, only the better-informed manufacturer shares information. The retailer always benefits from both manufacturers sharing information, and its benefits are larger when the better-informed manufacturer shares information. We show existence of a contracting mechanism the retailer can employ to enable information sharing. Finally, we analyze manufacturers’ information acquisition decisions and find that under competition, two manufacturers acquire minimal information so that they are better off not sharing information in the information sharing game. This paper was accepted by Vishal Gaur, operations management.

scholarly journals Accelerating the Social Media Process: The Impact of Internet Celebrity Word-of-Mouth Communication and Relationship Quality on Consumer Information Sharing

2020 ◽  
Vol 10 (1) ◽  
pp. 201
Author(s):  
Liping Liu ◽  
Chih-Cheng Fang
Keyword(s):  
Social Media ◽  
Information Sharing ◽  
Relationship Quality ◽  
Information Acquisition ◽  
Word Of Mouth ◽  
Rapid Development ◽  
Consumer Information ◽  
Research Fields ◽  
Word Of Mouth Communication ◽  
The Impact

With the rapid development of "Internet plus", the number of Internet users in China has increased rapidly, and the number of active users of social media software ranks first in the world. Large Numbers of network users are also potential consumer groups. Social media influences other consumers through consumer interaction and social interaction, and consumers are transformed into active information acquisition rather than passive information reception. Word of mouth marketing on social media has become one of the hottest research fields. Based on the information adoption model, this study explores the impact of internet celebrity word-of-mouth communication on consumer information sharing from four dimensions: internet celebrity word-of-mouth communication, relationship quality, face consciousness, and consumer information sharing and establishes a research model to provide references and suggestions for subsequent researchers and enterprise management.

scholarly journals A Reconfigurable IoT Architecture with Energy Efficient Event-Based Data Traffic Reduction Scheme

2017 ◽  
Vol 13 (02) ◽  
pp. 34 ◽  
Author(s):  
Varun Tiwari ◽  
Avinash Keskar ◽  
NC Shivaprakash
Keyword(s):  
Network Traffic ◽  
Energy Efficient ◽  
Data Transfer ◽  
Large Network ◽  
Data Traffic ◽  
Transfer Scheme ◽  
Data Packets ◽  
Traffic Reduction ◽  
Low Probability ◽  
Event Based

Designing an Internet of Things (IoT) enabled environment requires integration of various things/devices. Integrating these devices require a generalized approach as these devices can have different communication protocols. In this paper, we have proposed generalized nodes for connecting various devices. These nodes are capable of creating a scalable local wireless network that connects to the cloud through a network gateway. The nodes also support over the air programming to re-configure the network from the cloud. As number of devices connected to the cloud increases, the network traffic also increases. In order to reduce the network traffic we have used different data transfer schemes for the network. We have also proposed an event-based data transfer scheme for situations where there is low probability of change in sensor value. The experimental results shows that the event-based scheme reduces the data traffic by up to 48% under practical conditions without any loss of information compared to priority based data transfer. We have also shown that the proposed scheme is more reliable for data transfer in a large network with a success rate of 99.5% measured over 200 minutes for 1201 data packets.

Heuristic algorithms for on-line packing in three dimensions

1992 ◽  
Vol 13 (4) ◽  
pp. 589-605 ◽  
Author(s):  
Keoin Li ◽  
Kam Hoi Cheng
Keyword(s):  
Heuristic Algorithms ◽  
Three Dimensions ◽  
On Line

scholarly journals Detection and Countermeasure of Node Misbehaviour in Clustered Wireless Sensor Network

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Meenakshi Tripathi ◽  
M. S. Gaur ◽  
V. Laxmi ◽  
P. Sharma
Keyword(s):  
Energy Efficient ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Environment Monitoring ◽  
Detection Scheme ◽  
Data Packets ◽  
Battery Power ◽  
Processing Power ◽  
Simulation Results

Wireless sensor networks are widely used in many applications like battlefield monitoring, environment monitoring, and so forth. In all of these applications the cooperation among various sensor nodes is needed to forward the data packets to the base station. However, it expends the various resources of a sensor node such as battery power, storage, and processing power. Therefore, to conserve its own resources a node may become selfish by not forwarding the data to the others. This kind of attack has serious consequences if the attacker node is the leader of a cluster. In the presence of attack the base station will not be able to get the data from the victimized cluster while resources of the member of that cluster are being consumed. In this paper we propose a scheme called window based scheme (WBS) to detect this kind of misbehavior in WSN. Our detection scheme is energy efficient because most of the computations are done at base station only. Simulation results prove that our method detects and removes the attacker effectively and efficiently.

High Speed Noncontact Displacement Measuring System Using FPGA

2010 ◽  
Vol 44-47 ◽  
pp. 724-727
Author(s):  
Xing Guang Li ◽  
Gui Ying Li ◽  
Shuang Zhao
Keyword(s):  
Information Acquisition ◽  
High Speed ◽  
Sampling Rate ◽  
Relative Displacement ◽  
Measuring System ◽  
High Speed Adc ◽  
Line Array ◽  
Other Information ◽  
On Line ◽  
Triangle Theory

According to optical triangle theory, by detecting the position of reflection light spot on line array CCD. The pels signal is transformed into data flow by a high speed ADC for processing with the circuit composed of FPGA. The system can calculate the relative displacement between the reference point and the objects detected. The system has 50MHz sampling rate and USB2.0 bus, so it also can be applied in other information acquisition fields.

scholarly journals Information sharing and leakage in the two-echelon supply chain

2019 ◽  
Author(s):  
Jingru Wang ◽  
Zhiyuan Zhen ◽  
Qiang Yan
Keyword(s):  
Supply Chain ◽  
Information Sharing ◽  
Information Acquisition ◽  
Information Leakage ◽  
High Signal ◽  
Market Demand ◽  
Retail Competition ◽  
Ex Post ◽  
Private Signals ◽  
Demand Information

We consider ex post demand information sharing and leakage in a two-echelon supply chain consisting of one supplier and two retailers competing in quantities. The incumbent retailer has an advantage to acquire information about the market at a cost. If he invests in information acquisition, he privately acquires a signal about the market demand. We examine the incumbent’s incentive of information acquisition and sharing, and the upstream supplier’s information leakage strategy. We confirm that the incumbent’s information acquisition and sharing decisions depend on whether the information acquisition is observable. When it is observable, the incumbent fully shares his private signals even though the shared high signal may hurt him. However, when it is unobservable, the incumbent can share the favorable signal (low signal) and withhold the unfavorable signal (high signal). Moreover, we also find that the supplier will always leak the signal to the entrant no matter what signal she acquires. In addition, we demonstrate under the information sharing and leakage strategy, it may benefit the whole supply chain when the retail competition intensity is not very large.

scholarly journals Adaptive information sharing approach for crowd networks based on two stage optimization

2019 ◽  
Vol 3 (3) ◽  
pp. 284-302
Author(s):  
Xiaoni Wang ◽  
Zhiwen Pan ◽  
Zhouxia Li ◽  
Wen Ji ◽  
Feng Yang
Keyword(s):  
Objective Function ◽  
Information Sharing ◽  
Network Topology ◽  
Heuristic Algorithms ◽  
Dynamic Change ◽  
Task Completion ◽  
Content Type ◽  
Bee Colony ◽  
Information Demand ◽  
Sharing Patterns

Purpose This paper aims to optimize and evaluating the performance of the crowd networks through analyzing their information sharing patterns. That is, in a crowd network, the qualities of accomplishing tasks are highly dependent on the effective information sharing among intelligent subjects within the networks. Hence, proposing an adaptive information-sharing approach can help improve the performance of crowd networks on accomplishing tasks that are assigned to them. Design/methodology/approach This paper first introduces the factors that affect effectiveness of information-sharing pattern: the network topology, the resources owned by intelligent subjects and the degree of information demand. By analyzing the correlation between these factors and the performance of crowd networks, an Adaptive Information Sharing Approach for Crowd Networks (AISCN approach) is proposed. By referring to information needed for accomplishing the historical tasks that are assigned to a crowd network, the AISCN approach can explore the optimized information-sharing pattern based on the predefined composite objective function. The authors implement their approach on two crowd networks including bee colony and supply chain, to prove the effectiveness of the approach. Findings The shared information among intelligent subjects affects the efficiency of task completion in the crowd network. The factors that can be used to describe the effectiveness of information-sharing patterns include the network topology, the resources owned by intelligent subjects and the degree of information demand. The AISCN approach used heuristic algorithm to solve a composite objective function which takes all these factors into consideration, so that the optimized information-sharing pattern can be obtained. Originality/value This paper introduces a set of factors that can be used to describe the correlation between information-sharing pattern and performance of crowd network. By quantifying such correlation based on these factors, this paper proposes an adaptive information-sharing approach which can explore the optimized information-sharing pattern for a variety of crowd networks. As the approach is a data-driven approach that explores the information-sharing pattern based on the network’s performance on historical tasks and network’s characteristics, it is adaptive to the dynamic change (change of incoming tasks, change of network characteristics) of the target crowd network. To ensure the commonality of the information-sharing approach, the proposed approach is not designed for a specific optimization algorithm. In this way, during the implementation of the proposed approach, heuristic algorithms can be chosen according to the complexity of the target crowd network.

Sign in / Sign up

Export Citation Format

Share Document